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

Electronic data

  • CFLP-theory

    Accepted author manuscript, 266 KB, PDF document

    Available under license: CC BY-NC-ND

Links

Text available via DOI:

View graph of relations

The connected facility location polytope

Research output: Contribution to journalJournal articlepeer-review

Published
Close
<mark>Journal publication date</mark>10/01/2018
<mark>Journal</mark>Discrete Applied Mathematics
Volume234
Number of pages17
Pages (from-to)151-167
Publication StatusPublished
<mark>Original language</mark>English

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.

Bibliographic note

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.