Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty

DOI10.1007/978-3-319-28697-6_48zbMath1339.93044OpenAlexW2462447600MaRDI QIDQ2806955

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

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

Related Items (1)

Robustness in nonsmooth nonconvex optimization problems

Cites Work

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

This page was built for publication: Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty