Cutset inequalities for robust network design

DOI10.1007/978-3-642-21527-8_15MaRDI QIDQ3091492zbMATH OpenOpenAlexFDO

Authors Arie M. C. A. Koster, Manuel Kutschka, Christian Raack

Publication date 9 September 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21527-8_15

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Robust network design: formulations, valid inequalities, and computations
• Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
• The cut property under demand uncertainty
• A robustness approach to uncapacitated network design problems
• An approach to robust network design in telecommunications

Cited in

(7)

• Branch-and-cut methods for the network design problem with vulnerability constraints
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Robustness concepts for knapsack and network design problems under data uncertainty
• Robust delay-constrained routing in telecommunications
• Robustness concepts for knapsack and network design problems under data uncertainty. Gamma-, multi-band, submodular, and recoverable robustness
• The cut property under demand uncertainty
• Robust network design: formulations, valid inequalities, and computations

Describes a project that uses

Uses Software

• SNDlib

This page was built for publication: Cutset inequalities for robust network design

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