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.
- computational complexity
- flow algorithms