The connected facility location polytope

Leitner, Markus and Ljubic, Ivana and Salazar-Gonzalez, Juan-Jose and Sinnl, Markus (2018) The connected facility location polytope. Discrete Applied Mathematics, 234. pp. 151-167. ISSN 0166-218X

[img]
Preview
PDF (CFLP-theory)
CFLP_theory.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (272kB)

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.

Item Type:
Journal Article
Journal or Publication Title:
Discrete Applied Mathematics
Additional Information:
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.
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600/2604
Subjects:
ID Code:
126354
Deposited By:
Deposited On:
11 Jul 2018 09:30
Refereed?:
Yes
Published?:
Published
Last Modified:
27 Sep 2020 04:39