On Budgeted Optimization Problems

DOI10.1137/S0895480104445071MaRDI QIDQ5426878zbMATH OpenOpenAlexFDO

Authors 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

budgeted optimizationinverse problemsmatroid intersectionssubmodular flows

Mathematics Subject Classification ID

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

Recommendations

• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
• On the complexity and approximability of budget-constrained minimum cost flows
• Some budget applications of the maximal flow
• Cut problems in graphs with a budget constraint

Cited in

(14)

• Budget management with applications
• Budget constrained run orders in optimum design
• Algorithm for a budget problem
• On the budget exercise problem
• Bottleneck capacity expansion problems with general budget constraints
• Capital budgeting problems: a parameterized point of view
• Interdicting structured combinatorial optimization problems with {0,1}-objectives
• Design is as easy as optimization
• Some budget applications of the maximal flow
• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
• Symmetric interdiction for matching problems
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• scientific article; zbMATH DE number 2195276 (Why is no real title available?)
• Efficient algorithms for robustness in resource allocation and scheduling problems

This page was built for publication: On Budgeted Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426878)