On Budgeted Optimization Problems
Alpár Jüttner
Source record
Source: Crossref
Published: Jan 1, 2006
DOI: 10.1137/s0895480104445071
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.