Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities

DOI10.1016/j.ejor.2012.09.040zbMath1292.90165OpenAlexW2141530847WikidataQ62048278 ScholiaQ62048278MaRDI QIDQ2253496

Ivana Ljubić, Stefan Gollowitzer, Luís Gouveia

Publication date: 27 July 2014

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.09.040

zbMATH Keywords

integer programminglinear programming relaxationsOR in telecommunicationshierarchical network designnetwork design and facility locationtree-tree networks

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (8)

A two-level location-allocation problem in designing local access fiber optic networks ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator ⋮ Design of fiber cable tree FTTH networks ⋮ Fiber cable network design in tree networks ⋮ Multi-level facility location problems ⋮ Towards optimizing the deployment of optical access networks ⋮ Lagrangian decompositions for the two-level FTTx network design problem

Uses Software

• SteinLib
• CPLEX

This page was built for publication: Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities