Top

, Volume 4, Issue 1, pp 135–163 | Cite as

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

  • A. Caprara
  • J. J. Salazar González
Article

Summary

We 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.

Keywords

Location Index Selection Problem Branch and Cut 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bilde, O. and J. Krarup (1977). “Sharp Lower Bounds and Efficient algorithms for the Simple Plant Location Problem”,Annals of Discrete Mathematics 1, 79–97.CrossRefGoogle Scholar
  2. Balas, E. and M.W. Padberg (1976). “Set Partitioning: A survey”,SIAM Review 18, 710–760.CrossRefGoogle Scholar
  3. Caprara, A. and M. Fischetti (1993). “Odd-Cut Sets, Odd Cycles, and 0–1/2 Chvátal-gomory cuts”, working paper, University of Bologna.Google Scholar
  4. Caprara, A., M. Fischetti and D. Maio, (1995). “Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design”,IEEE Transactions on Knowledge and Data Engineering 7, 955–967.CrossRefGoogle Scholar
  5. Ceria, S. (1994). “Solving Mixed Integer Programs with General Cutting Planes”, talk presented at the workshopSolving Large and Complex Optimization Problems, Giens.Google Scholar
  6. Cho, D.C., E.L. Johnson, M.W. Padberg and M.R. Rao, (1983). “On the Uncapacitated Plant Location Problem. I: valid Inequalities and Faces”,Mathematics of Operations Research 8, 579–589.Google Scholar
  7. Cho, D.C., M.W. Padberg and M.R. Rao, (1983) “On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems”,Mathematics of Operations Research 8, 590–612.Google Scholar
  8. Conn, A.R. and G. Cornuejols (1990). “A Projection Method for the Uncapacitated Facility Location Problem”,Mathematical Programming 46, 273–298.CrossRefGoogle Scholar
  9. Cornuejols, G., G.L. Nemhauser and L.A. Wolsey (1991). “The Uncapacitated Facility Location Problem”, in P.B. Mirchandani, R.L. Francis.Discrete Location Theory, John Wiley.Google Scholar
  10. Conuejols, G. and J.M. Thizy, (1982). “Some Facets of the Simple Plant Location Polytope”,Mathematical Programming 23, 50–74.CrossRefGoogle Scholar
  11. Cornuejols, G. and J.M. Thizy (1982). “A Primal Approach to the Simple Plant Location Problem”,SIAM Journal on Algebraic and Discrete Methods 3, 504–510.Google Scholar
  12. Erlenkotter, D. (1978). “A Dual-Based Procedure for Uncapacitated Facility Location”.Operations Research 26, 992–1009.CrossRefGoogle Scholar
  13. Finkelstein, S., M. Schkolnick and P. Tiberio (1988). “Physical Database Design for Relational Databases”,ACM Transactions on Database Systems 13, 91–128.CrossRefGoogle Scholar
  14. Grötschel, M., L. Lovász and A. Schrijver (1988).Geometric Algorithms and Combinatorial Optimization, Springer-Verlag.Google Scholar
  15. Guignard, M. (1980). “Fractional Vertices, Cuts and Facets of the Simple Plant Location Problem”,Mathematical Programming Study 12, 150–162.Google Scholar
  16. Krarup, J. and P.M. Pruzan (1983). “The Simple Plant Location Problem: Survey and Synthesis”,European Journal of Operational Research 12, 36–81.CrossRefGoogle Scholar
  17. Morris, J.G. (1978). “On the Extent to Which Certain Fixed-Charge Depot Location. Problems Can Be Solved by LP”,Journal of the Operational Research Society 29, 71–76.CrossRefGoogle Scholar
  18. Nemhauser, G.L. and G. Sigismondi (1992). “A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing”,Journal of Operational Research Society 43, 443–457.CrossRefGoogle Scholar
  19. Padberg, M.W. (1973). “On the Facial Structure of Set Packing Problems”,Mathematical Programming 5, 199–215.CrossRefGoogle Scholar
  20. Padberg, M.W. and G. Rinaldi (1991). “A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems”,SIAM Review 33, 60–100.CrossRefGoogle Scholar

Copyright information

© Sociedad de Estadística e Investigación Operativa 1996

Authors and Affiliations

  • A. Caprara
    • 1
  • J. J. Salazar González
    • 2
  1. 1.DEISUniversity of BolognaItaly
  2. 2.DEIOCUniversity of La LagunaSpain

Personalised recommendations