The connected facility location polytope

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.

[1]  Laurence A. Wolsey,et al.  Trees and Cuts , 1983 .

[2]  S. Raghavan,et al.  Dual-Based Local Search for the Connected Facility Location and Related Problems , 2010, INFORMS J. Comput..

[3]  Jun Huang,et al.  Connected distribution center location problem under traffic network in emergency management , 2012, 2012 Fifth International Joint Conference on Computational Sciences and Optimization.

[4]  Juan José Salazar González,et al.  On the Asymmetric Connected Facility Location Polytope , 2014, ISCO.

[5]  Karen Aardal,et al.  On the Two-Level Uncapacitated Facility Location Problem , 1996, INFORMS J. Comput..

[6]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[7]  M. Guignard.  Fractional vertices, cuts and facets of the simple plant location problem , 1980 .

[8]  Kurt Mehlhorn,et al.  A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[9]  Fabrizio Grandoni,et al.  Approximation Algorithms for Single and Multi-Commodity Connected Facility Location , 2011, IPCO.

[10]  David R. Karger,et al.  Building Steiner trees with incomplete global knowledge , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11]  Juan José Salazar González,et al.  A note on the generalized steiner tree polytope , 2000, Discret. Appl. Math..

[12]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[13]  Markus Leitner,et al.  Branch-and-Cut-and-Price for Capacitated Connected Facility Location , 2011, J. Math. Model. Algorithms.

[14]  Gérard Cornuéjols,et al.  Some facets of the simple plant location polytope , 1982, Math. Program..

[15]  Harald Räcke,et al.  Approximation algorithms for data management in networks , 2001, SPAA.

[16]  Mauricio G. C. Resende,et al.  Strong lower bounds for the prize collecting Steiner problem in graphs , 2004, Discret. Appl. Math..

[17]  Juan José Salazar González,et al.  An algorithmic framework for the exact solution of tree-star problems , 2017, Eur. J. Oper. Res..

[18]  Horst W. Hamacher,et al.  Adapting polyhedral properties from facility to hub location problems , 2004, Discret. Appl. Math..

[19]  T. Koch,et al.  Solving Steiner Tree Problems in Graphs to Optimality , 1998 .

[20]  Frédéric Havet,et al.  The Push Tree problem , 2004 .

[21]  Ivana Ljubic,et al.  MIP models for connected facility location: A theoretical and computational study☆ , 2011, Comput. Oper. Res..