Robustness concepts for knapsack and network design problems under data uncertainty

DOI10.1007/978-3-319-28697-6_48MaRDI QIDQ2806955zbMATH OpenOpenAlexFDO

Authors Manuel Kutschka

Publication date 19 May 2016

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28697-6_48

zbMATH Keywords

data uncertaintyknapsack problemsnetwork design problemsrobustness concepts

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Sensitivity (robustness) (93B35) Control/observation systems with incomplete information (93C41)

Recommendations

• Robustness concepts for knapsack and network design problems under data uncertainty. Gamma-, multi-band, submodular, and recoverable robustness
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
• Recoverable robust knapsacks: the discrete scenario case
• Cutset inequalities for robust network design
• Complexity results and exact algorithms for robust knapsack problems

Cites work

• Polymatroids and mean-risk minimization in discrete optimization
• Provisioning virtual private networks under traffic uncertainty
• Robust discrete optimization and network flows
• The Price of Robustness
• The submodular knapsack polytope

Cited in

(4)

• A robustness approach to uncapacitated network design problems
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
• Robustness concepts for knapsack and network design problems under data uncertainty. Gamma-, multi-band, submodular, and recoverable robustness
• Robustness in nonsmooth nonconvex optimization problems

This page was built for publication: Robustness concepts for knapsack and network design problems under data uncertainty

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