A branch-and-cut algorithm for a generalization of the Uncapacitated Facility Location Problem

SummaryWe introduce a generalization of the well-know Uncapacitated Facility Location Problem, in which clients can be served not only by single facilities but also by sets of facilitities. The problem, calledGaneralized Uncapacitated Facility Lacition Problem (GUFLP), was inspired by the Index Selection Problem in physical database design. We for mulate GUFLP as a Set Packing Problem, showing that our model contains all the clique inequalities (in polynomial number). Moreover, we describe and exact separation procedure for odd-hole inequalities, based on the particular structure of the problem. These results are used within a branch-and-cut algorithm for the exact solution of GUFLP. Computational results on two different classes of test problems are given.

[1]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

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

[3]  J. Krarup,et al.  Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .

[4]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

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

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

[7]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[8]  Matteo Fischetti,et al.  Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design , 1995, IEEE Trans. Knowl. Data Eng..

[9]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[10]  Gérard Cornuéjols,et al.  A projection method for the uncapacitated facility location problem , 1990, Math. Program..

[11]  M. Schkolnick,et al.  Physical database design for relational databases , 1988, TODS.

[12]  G. Nemhauser,et al.  A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing , 1992 .

[13]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[14]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

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

[16]  James G. Morris,et al.  On the Extent to Which Certain Fixed-Charge Depot Location Problems can be Solved by LP , 1978 .

[17]  G. Cornuéjols,et al.  A Primal Approach To the Simple Plant Location Problem , 1982 .