Models and Algorithms for Robust Network Design with Several Traffic Scenarios

DOI10.1007/978-3-642-32147-4_24zbMath1370.90032OpenAlexW151938810MaRDI QIDQ3167631

Frauke Liers, Tim Dorneth, Michael Jünger, Daniel R. Schmidt, Tiziano Parriani, Eduardo Álvarez-Miranda, Andrea Lodi, Valentina Cacchiani

Publication date: 2 November 2012

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

Full work available at URL: http://e-archive.informatik.uni-koeln.de/640/1/RND.pdf

zbMATH Keywords

separationlarge neighborhood searchcut-set inequalitiesrobust network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items

Single-commodity robust network design with finite and hose demand sets, Single-commodity robust network design problem: complexity, instances and heuristic solutions, Generalized hose uncertainty in single-commodity robust network design, Robust minimum cost flow problem under consistent flow constraints, Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks, Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints