| Article ID: | iaor19911076 |
| Country: | Netherlands |
| Volume: | 9 |
| Issue: | 5 |
| Start Page Number: | 315 |
| End Page Number: | 318 |
| Publication Date: | Sep 1990 |
| Journal: | Operations Research Letters |
| Authors: | Hassin Refael |
The paper considers 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. The paper shows how to solve all of the problems in the family by selecting and solving a small subset of them.