TY - GEN
T1 - On the asymmetric connected facility location polytope
AU - Leitner, Markus
AU - Ljubić, Ivana
AU - Salazar-González, Juan José
AU - Sinnl, Markus
PY - 2014/1/1
Y1 - 2014/1/1
N2 - This paper is concerned with the connected facility location problem, which has been intensively studied in the literature. The underlying polytopes, however, have not been investigated. This work is devoted to the polytope associated with the asymmetric version of the problem. We first lift known facets of the related Steiner arborescence and of the facility location polytope. Then we describe other new families of facet-inducing inequalities. Finally, computational results are reported.
AB - This paper is concerned with the connected facility location problem, which has been intensively studied in the literature. The underlying polytopes, however, have not been investigated. This work is devoted to the polytope associated with the asymmetric version of the problem. We first lift known facets of the related Steiner arborescence and of the facility location polytope. Then we describe other new families of facet-inducing inequalities. Finally, computational results are reported.
UR - http://www.scopus.com/inward/record.url?scp=84905844099&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84905844099&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-09174-7_32
DO - 10.1007/978-3-319-09174-7_32
M3 - Conference contribution
AN - SCOPUS:84905844099
SN - 9783319091730
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 371
EP - 383
BT - Combinatorial Optimization - Third International Symposium, ISCO 2014, Revised Selected Papers
PB - Springer - Verlag
T2 - 3rd International Symposium on Combinatorial Optimization, ISCO 2014
Y2 - 5 March 2014 through 7 March 2014
ER -