| Article ID: | iaor2005750 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 6 |
| Start Page Number: | 530 |
| End Page Number: | 534 |
| Publication Date: | Nov 2004 |
| Journal: | Operations Research Letters |
| Authors: | Levin Asaf |
| Keywords: | sets |
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm.