Robustness concepts for knapsack and network design problems under data uncertainty
From MaRDI portal
Publication:2806955
DOI10.1007/978-3-319-28697-6_48zbMATH Open1339.93044OpenAlexW2462447600MaRDI QIDQ2806955FDOQ2806955
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
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
Combinatorial optimization (90C27) Integer programming (90C10) Sensitivity (robustness) (93B35) Control/observation systems with incomplete information (93C41)
Cites Work
Cited In (4)
- Robustness in nonsmooth nonconvex optimization problems
- A robustness approach to uncapacitated network design problems
- 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
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)