Accepted author manuscript, 559 KB, PDF document
Available under license: CC BY-NC-ND
Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - An algorithmic framework for the exact solution of tree-star problems
AU - Leitner, Markus
AU - Ljubic, Ivana
AU - Salazar-Gonzalez, Juan Jose
AU - Sinnl, Markus
N1 - This is the author’s version of a work that was accepted for publication in European Journal of Operational Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Operational Research
PY - 2017/8/16
Y1 - 2017/8/16
N2 - Many problems arising in the area of telecommunication ask for solutions with a tree-star topology. This paper proposes a general procedure for finding optimal solutions to a family of these problems. The family includes problems in the literature named as connected facility location, rent-or-buy and generalized Steiner tree-star. We propose a solution framework based on a branch-and-cut algorithm which also relies on sophisticated reduction and heuristic techniques. An important ingredient of this framework is a dual ascent procedure for asymmetric connected facility location. This paper shows how this procedure can be exploited in combination with various mixed integer programming formulations. Using the new framework, many benchmark instances in the literature for which only heuristic results were available so far, can be solved to provable optimality within seconds. To better assess the computational performance of the new approach, we additionally consider larger instances and provide optimal solutions for most of them too.
AB - Many problems arising in the area of telecommunication ask for solutions with a tree-star topology. This paper proposes a general procedure for finding optimal solutions to a family of these problems. The family includes problems in the literature named as connected facility location, rent-or-buy and generalized Steiner tree-star. We propose a solution framework based on a branch-and-cut algorithm which also relies on sophisticated reduction and heuristic techniques. An important ingredient of this framework is a dual ascent procedure for asymmetric connected facility location. This paper shows how this procedure can be exploited in combination with various mixed integer programming formulations. Using the new framework, many benchmark instances in the literature for which only heuristic results were available so far, can be solved to provable optimality within seconds. To better assess the computational performance of the new approach, we additionally consider larger instances and provide optimal solutions for most of them too.
KW - Combinatorial optimization
KW - Connected facility location
KW - Branch-and-cut
KW - Dual ascent
KW - Benders decomposition
U2 - 10.1016/j.ejor.2017.02.011
DO - 10.1016/j.ejor.2017.02.011
M3 - Journal article
VL - 261
SP - 54
EP - 66
JO - European Journal of Operational Research
JF - European Journal of Operational Research
SN - 0377-2217
IS - 1
ER -