MIP modeling of incremental connected facility location

DOI10.1007/978-3-642-21527-8_54MaRDI QIDQ3091533zbMATH OpenOpenAlexWikidataFDO

Authors Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubić, 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

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

Recommendations

• The incremental connected facility location problem
• MIP models for connected facility location: a theoretical and computational study
• The multi-period incremental service facility location problem
• Branch-and-cut-and-price for capacitated connected facility location
• A cutting plane algorithm for the capacitated connected facility location problem

Cited in

(10)

• The p-arborescence star problem: formulations and exact solution approaches
• A MIP-based approach to solve the prize-collecting local access network design problem
• The incremental connected facility location problem
• A cutting plane algorithm for the capacitated connected facility location problem
• Towards optimizing the deployment of optical access networks
• Benders decomposition of the passive optical network design problem
• A computational comparison of several formulations for the multi-period incremental service facility location problem
• Branch-and-cut-and-price for capacitated connected facility location
• MIP models for connected facility location: a theoretical and computational study
• The multi-period incremental service facility location problem

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: MIP modeling of incremental connected facility location

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