ON THE INTEGRALITY OF THE UNCAPACITATED FACILITY LOCATION POLYTOPE

We study a system of linear inequalities associated with the uncapacitated facility location problem. We show that this system defines a polytope with integer extreme points if and only if the graph does not contain a certain type of odd cycles. We also derive odd cycle inequalities and give a separation algorithm.

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

[2]  G. Nemhauser,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2014 .

[3]  Michele Conforti,et al.  Structural properties and recognition of restricted and strongly unimodular matrices , 1987, Math. Program..

[4]  Manfred Padberg,et al.  On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets , 1983, Math. Oper. Res..

[5]  Mihalis Yannakakis.  On a class of totally unimodular matrices , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[6]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[7]  Mercedes Landete,et al.  On the facets of the simple plant location packing polytope , 2002, Discret. Appl. Math..

[8]  Maxim Sviridenko.  An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2002, IPCO.

[9]  Francisco Barahona,et al.  On the p-median polytope of Y-free graphs , 2008, Discret. Optim..

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

[11]  D. Chinhyung Cho,et al.  On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems , 1983, Math. Oper. Res..

[12]  Fabián A. Chudak,et al.  Improved Approximation Algorithms for the Uncapacitated Facility Location Problem , 2003, SIAM J. Comput..