An Exact Algorithm for Robust Network Design
From MaRDI portal
Publication:3091477
DOI10.1007/978-3-642-21527-8_2zbMath1345.90027OpenAlexW198748327MaRDI QIDQ3091477
Christoph Buchheim, Frauke Liers, Laura Sanità
Publication date: 9 September 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://e-archive.informatik.uni-koeln.de/615/2/zaik2011-615.pdf
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Related Items (8)
Reformulating the disjunctive cut generating linear program ⋮ Single-commodity robust network design with finite and hose demand sets ⋮ Single-commodity robust network design problem: complexity, instances and heuristic solutions ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ Generalized hose uncertainty in single-commodity robust network design ⋮ On the robustness of potential-based flow networks ⋮ Network design with a discrete set of traffic matrices ⋮ Target Cuts from Relaxed Decision Diagrams
This page was built for publication: An Exact Algorithm for Robust Network Design
