The Recoverable Robust Two-Level Network Design Problem

DOI10.1287/ijoc.2014.0606zbMath1327.90346OpenAlexW2112763366WikidataQ62048269 ScholiaQ62048269MaRDI QIDQ2942678

Ivana Ljubić, Paolo Toth, Eduardo Álvarez-Miranda, S. Raghu 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 cutrobust optimizationnetwork designmixed-integer programming

Mathematics Subject Classification ID

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

Related Items (8)

Two-level rectilinear Steiner trees ⋮ 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 ⋮ 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 ⋮ Reducing Conservatism in Robust Optimization ⋮ Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem

This page was built for publication: The Recoverable Robust Two-Level Network Design Problem