Robust Metric Inequalities for Network Loading Under Demand Uncertainty

DOI10.1142/S0217595915500384zbMath1330.90015MaRDI QIDQ3455882

Manuel Kutschka, Arie M. C. A. Koster, Issam Tahiri, Grit Claßen

Publication date: 11 December 2015

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

robust optimizationcapacity formulationmetric inequalitiesnetwork loading

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

Generalized hose uncertainty in single-commodity robust network design, Affine routing for robust network design, On the approximability of robust network design

Cites Work

• The convex hull of two core capacitated network design problems
• Combinatorial approaches to multiflow problems
• A branch-and-cut algorithm for capacitated network design problems
• The robust network loading problem with dynamic routing
• Metric inequalities and the network loading problem
• The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
• Polyhedral structure of the 4-node network design problem
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• CORRELATIONS IN STOCHASTIC PROGRAMMING: A CASE FROM STOCHASTIC SERVICE NETWORK DESIGN
• The Price of Robustness
• AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM
• Network Design Using Cut Inequalities
• Robust network design: Formulations, valid inequalities, and computations
• Benders decomposition approach for the robust network design problem with flow bifurcations
• k-Partition-based facets of the network design problem