Home > Research > Publications & Outputs > The connected facility location polytope

Research

Electronic data

  • CFLP-theory

    Accepted author manuscript, 266 KB, PDF document

    Available under license: CC BY-NC-ND

Links

Text available via DOI:

Keywords

View graph of relations

The connected facility location polytope

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

The connected facility location polytope. / Leitner, Markus; Ljubic, Ivana; Salazar-Gonzalez, Juan-Jose et al.
In: Discrete Applied Mathematics, Vol. 234, 10.01.2018, p. 151-167.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Leitner, M, Ljubic, I, Salazar-Gonzalez, J-J & Sinnl, M 2018, 'The connected facility location polytope', Discrete Applied Mathematics, vol. 234, pp. 151-167. https://doi.org/10.1016/j.dam.2016.08.010

APA

Leitner, M., Ljubic, I., Salazar-Gonzalez, J-J., & Sinnl, M. (2018). The connected facility location polytope. Discrete Applied Mathematics, 234, 151-167. https://doi.org/10.1016/j.dam.2016.08.010

Vancouver

Leitner M, Ljubic I, Salazar-Gonzalez J-J, Sinnl M. The connected facility location polytope. Discrete Applied Mathematics. 2018 Jan 10;234:151-167. doi: 10.1016/j.dam.2016.08.010

Author

Leitner, Markus ; Ljubic, Ivana ; Salazar-Gonzalez, Juan-Jose et al. / The connected facility location polytope. In: Discrete Applied Mathematics. 2018 ; Vol. 234. pp. 151-167.

Bibtex

@article{5bdfe24648734a87822c3f1175b15cda,
title = "The connected facility location polytope",
abstract = "We analyze the polytope associated with a combinatorial problem that combines the Steiner tree problem and the uncapacitated facility location problem. The problem, called connected facility location problem, is motivated by a real-world application in the design of a telecommunication network, and concerns with deciding the facilities to open, the assignment of customers to open facilities, and the connection of the open facilities through a Steiner tree. Several solution approaches are proposed in the literature, and the contribution of our work is a polyhedral analysis for the problem. We compute the dimension of the polytope, present valid inequalities, and analyze conditions for these inequalities to be facet defining. Some inequalities are taken from the Steiner tree polytope and the uncapacitated facility location polytope. Other inequalities are new.",
keywords = "Valid inequalities, Facets, Facility location, Steiner trees",
author = "Markus Leitner and Ivana Ljubic and Juan-Jose Salazar-Gonzalez and Markus Sinnl",
note = "This is the author{\textquoteright}s version of a work that was accepted for publication in Discrete Applied Mathematics. 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.",
year = "2018",
month = jan,
day = "10",
doi = "10.1016/j.dam.2016.08.010",
language = "English",
volume = "234",
pages = "151--167",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - The connected facility location polytope

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 Discrete Applied Mathematics. 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.

PY - 2018/1/10

Y1 - 2018/1/10

N2 - We analyze the polytope associated with a combinatorial problem that combines the Steiner tree problem and the uncapacitated facility location problem. The problem, called connected facility location problem, is motivated by a real-world application in the design of a telecommunication network, and concerns with deciding the facilities to open, the assignment of customers to open facilities, and the connection of the open facilities through a Steiner tree. Several solution approaches are proposed in the literature, and the contribution of our work is a polyhedral analysis for the problem. We compute the dimension of the polytope, present valid inequalities, and analyze conditions for these inequalities to be facet defining. Some inequalities are taken from the Steiner tree polytope and the uncapacitated facility location polytope. Other inequalities are new.

AB - We analyze the polytope associated with a combinatorial problem that combines the Steiner tree problem and the uncapacitated facility location problem. The problem, called connected facility location problem, is motivated by a real-world application in the design of a telecommunication network, and concerns with deciding the facilities to open, the assignment of customers to open facilities, and the connection of the open facilities through a Steiner tree. Several solution approaches are proposed in the literature, and the contribution of our work is a polyhedral analysis for the problem. We compute the dimension of the polytope, present valid inequalities, and analyze conditions for these inequalities to be facet defining. Some inequalities are taken from the Steiner tree polytope and the uncapacitated facility location polytope. Other inequalities are new.

KW - Valid inequalities

KW - Facets

KW - Facility location

KW - Steiner trees

U2 - 10.1016/j.dam.2016.08.010

DO - 10.1016/j.dam.2016.08.010

M3 - Journal article

VL - 234

SP - 151

EP - 167

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -