An algorithm for computing maximum solution bases

Rafael Hassin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We consider a family of problems defined on a common solution space. A problem is characterized by a subset of the solution space whose elements are defined to be feasible for that problem. Each solution is associated with a cost. Solving a problem means finding a feasible solution of minimum cost. It is assumed that an algorithm for solving any single problem is available. We show how to solve all of the problems in the family by selecting and solving a small subset of them.

Original languageEnglish
Pages (from-to)315-318
Number of pages4
JournalOperations Research Letters
Issue number5
StatePublished - Sep 1990


  • combinatorics
  • computational complexity
  • flow algorithms


Dive into the research topics of 'An algorithm for computing maximum solution bases'. Together they form a unique fingerprint.

Cite this