Design is as Easy as Optimization
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
In this paper we give a method for solving certain budgeted optimization problems in strongly polynomial time. The method can be applied to several known budgeted problems, and in addition we show two new applications. The first one extends Frederickson’s and Solis-Oba’s result [G. N. Frederickson and R. Solis-Oba, Combinatorica, 18 (1998), pp. 503-518] to (poly)matroid intersections from single matroids. The second one is the budgeted version of the minimum cost circulation problem.