The recoverable robust two-level network design problem

DOI10.1287/IJOC.2014.0606MaRDI QIDQ2942678zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Eduardo Álvarez-Miranda, Ivana Ljubić, Paolo Toth, S. Raghavan

Publication date 11 September 2015

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2014.0606

zbMATH Keywords

branch and cutmixed-integer programmingnetwork designrobust optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47)

Recommendations

• Two-stage robust network design with exponential scenarios
• Two-Stage Robust Network Design with Exponential Scenarios
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• Robust Two-Stage Network Problems
• Stochastic survivable network design problems: theory and practice

Cited in

(9)

• Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
• A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
• Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
• Two-level rectilinear Steiner trees
• Robust Two-Stage Network Problems
• Reducing Conservatism in Robust Optimization
• Telecommunications network design: Technology impacts and future directions
• Robust flows with adaptive mitigation
• Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints

This page was built for publication: The recoverable robust two-level network design problem

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