MIP Modeling of Incremental Connected Facility Location

DOI10.1007/978-3-642-21527-8_54zbMath1346.90478OpenAlexW205094419WikidataQ62048292 ScholiaQ62048292MaRDI QIDQ3091533

Andreas Bley, Ivana Ljubić, Stefan Gollowitzer, Ashwin Arulselvan, Olaf Maurer

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_54

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (6)

The \(p\)-arborescence star problem: formulations and exact solution approaches ⋮ Benders decomposition of the passive optical network design problem ⋮ A cutting plane algorithm for the capacitated connected facility location problem ⋮ A MIP-based approach to solve the prize-collecting local access network design problem ⋮ Towards optimizing the deployment of optical access networks ⋮ The incremental connected facility location problem

Uses Software

• OR-Library

This page was built for publication: MIP Modeling of Incremental Connected Facility Location