On Budgeted Optimization Problems

DOI10.1137/S0895480104445071zbMath1136.90036OpenAlexW2067993964MaRDI QIDQ5426878

Alpár Jüttner

Publication date: 16 November 2007

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480104445071

zbMATH Keywords

inverse problemsbudgeted optimizationsubmodular flowsmatroid intersections

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Sensitivity, stability, parametric optimization (90C31)

Related Items (4)

Efficient algorithms for robustness in resource allocation and scheduling problems ⋮ Unnamed Item ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Bottleneck Capacity Expansion Problems with General Budget Constraints

This page was built for publication: On Budgeted Optimization Problems