Skip to main content
SpringerLink
Log in

On the Location and p-Median Polytopes

  • Chapter
Research Trends in Combinatorial Optimization

  • 2458 Accesses

Summary

We revisit classical systems of linear inequalities associated with location problems and with the p-median problem. We present an overview of the cases for which these linear systems define integral polytopes. We also give polynomial time algorithms to recognize these cases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Avella, P., Sassano, A.: On the p-median polytope. Math. Program. 89, 395–411 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  • Baïou, M., Barahona, F.: On the p-median polytope of Y-free graphs Discrete Optim. 5(2), 205–219 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  • Baïou, M., Barahona, F.: On the integrality of the uncapacitated facility location polytope. Technical Report RC24101, IBM Watson Research Center (2006)

    Google Scholar 

  • Baïou, M., Barahona, F.: On the linear relaxation p-median problem I: oriented graphs. Technical Report, IBM Watson Research Center (2007a)

    Google Scholar 

  • Baïou, M., Barahona, F.: On the linear relaxation p-median problem II: directed graphs. Technical report, IBM Watson Research Center (2007b)

    Google Scholar 

  • Byrka, J., Aardal, K.: The approximation gap for the metric facility location problem is not yet closed. Oper. Res. Lett. 35, 379–384 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  • Cánovas, L., Landete, M., Marín, A.: On the facets of the simple plant location packing polytope. Discrete Appl. Math. 124, 27–53 (2002). Workshop on Discrete Optimization (Piscataway, NJ, 1999)

    Article  MATH  MathSciNet  Google Scholar 

  • Caprara, A., Fischetti, M.: \(\{0,\frac{1}{2}\}\) -Chvátal–Gomory cuts. Math. Program. 74, 221–235 (1996)

    MathSciNet  Google Scholar 

  • Cho, D.C., Johnson, E.L., Padberg, M., Rao, M.R.: On the uncapacitated plant location problem. I. Valid inequalities and facets. Math. Oper. Res. 8, 579–589 (1983a)

    Article  MATH  MathSciNet  Google Scholar 

  • Cho, D.C., Padberg, M.W., Rao, M.R.: On the uncapacitated plant location problem. II. Facets and lifting theorems. Math. Oper. Res. 8, 590–612 (1983b)

    Article  MATH  MathSciNet  Google Scholar 

  • Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33, 1–25 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Chvátal, V.: On certain polytopes associated with graphs. J. Comb. Theory, Ser. B 18, 138–154 (1975)

    Article  MATH  Google Scholar 

  • Conforti, M., Rao, M.R.: Structural properties and recognition of restricted and strongly unimodular matrices. Math. Program. 38, 17–27 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  • Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manage. Sci. 23, 789–810 (1976/77)

    Article  MathSciNet  Google Scholar 

  • Cornuejols, G., Thizy, J.-M.: Some facets of the simple plant location polytope. Math. Program. 23, 50–74 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  • de Farias, I.R. Jr.: A family of facets for the uncapacitated p-median polytope. Oper. Res. Lett. 28, 161–167 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  • De Simone, C., Mannino, C.: Easy instances of the plant location problem. Technical Report R. 427, IASI, CNR (1996)

    Google Scholar 

  • Guignard, M.: Fractional vertices, cuts and facets of the simple plant location problem, Math. Program. Stud. (1980), pp. 150–162. Combinatorial optimization

    Google Scholar 

  • Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart & Winston, New York (1976)

    MATH  Google Scholar 

  • Mirchandani, P.B., Francis, R.L. (eds.): Discrete Location Theory, Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1990)

    MATH  Google Scholar 

  • Müller, R., Schulz, A.S.: Transitive packing: a unifying concept in combinatorial optimization. SIAM J. Optim. 13, 335–367 (2002) (electronic)

    Article  MATH  MathSciNet  Google Scholar 

  • Nestorov, S., Abiteboul, S., Motwani, R.: Extracting schema from semistructured data. In: SIGMOD ’98: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 295–306. ACM Press, New York (1998)

    Chapter  Google Scholar 

  • Shmoys, D.B., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: 29th ACM Symposium on Theory of Computing, pp. 265–274 (1997)

    Google Scholar 

  • Stauffer, G.: The p-median polytope of Y-free graphs: an application of the matching theory. Technical Report (2007). To appear in Oper. Res. Lett.

    Google Scholar 

  • Sviridenko, M.: An improved approximation algorithm for the metric uncapacitated facility location problem. In: Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 2337, pp. 240–257. Springer, Berlin (2002)

    Chapter  Google Scholar 

  • Toumani, F.: Personal communication (2002)

    Google Scholar 

  • Vigneron, A., Gao, L., Golin, M.J., Italiano, G.F., Li, B.: An algorithm for finding a k-median in a directed tree. Inf. Process. Lett. 74, 81–88 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  • Yannakakis, M.: On a class of totally unimodular matrices. Math. Oper. Res. 10, 280–304 (1985)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, LIMOS Complexe scientifique des Cezeaux, CUST – Campus des Cezeaux, BP 206 – 63174, Aubière Cedex, France

    Mourad Baïou

  2. IBM T.J. Watson Research Center, Yorktown Heights, NY, 10589, USA

    Francisco Barahona

Authors
  1. Mourad Baïou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francisco Barahona
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Industrial and Systems Engineering, Georgia Tech, 765 Ferst Drive, Atlanta, Georgia, 30332-0205, USA

    William Cook

  2. Institute of Mathematics, Eötvös Loránd University, Pázmány Péter sétány 1/C, H-1117, Budapest, Hungary

    László Lovász

  3. Research Institute for Discrete Mathematics, University of Bonn, Lennéstr. 2, 53113, Bonn, Germany

    Jens Vygen

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Baïou, M., Barahona, F. (2009). On the Location and p-Median Polytopes. In: Cook, W., Lovász, L., Vygen, J. (eds) Research Trends in Combinatorial Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76796-1_1

Download citation

Publish with us

Policies and ethics

Search

Navigation