Skip to main content
SpringerLink
Log in

On the Asymmetric Connected Facility Location Polytope

  • Conference paper
  • First Online:
Combinatorial Optimization (ISCO 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8596))

Included in the following conference series:

Abstract

This paper is concerned with the connected facility location problem, which has been intensively studied in the literature. The underlying polytopes, however, have not been investigated. This work is devoted to the polytope associated with the asymmetric version of the problem. We first lift known facets of the related Steiner arborescence and of the facility location polytope. Then we describe other new families of facet-inducing inequalities. Finally, computational results are reported.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Gollowitzer, S., Ljubić, I.: MIP models for connected facility location: a theoretical and computational study. Comput. Oper. Res. 38(2), 435–449 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  2. Leitner, M., Raidl, G.R.: Branch-and-cut-and-price for capacitated connected facility location. J. Math. Model. Algorithms 10(3), 245–267 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  3. Leitner, M., Ljubić, I., Salazar-González, J.J., Sinnl, M.: The connected facility location polytope: valid inequalities, facets and a computational study. Submitted (2014)

    Google Scholar 

  4. Fischetti, M.: Facets of two Steiner arborescence polyhedra. Math. Program. 51, 401–419 (1991)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1999)

    MATH  Google Scholar 

  7. Guignard, M.: Fractional vertices, cuts and facets of the simple plant location problem. In: Padberg, M. (ed.) Combinatorial Optimization. Mathematical Programming Studies, vol. 12, pp. 150–162. Springer, Heidelberg (1980)

    Chapter  Google Scholar 

  8. Bardossy, M.G., Raghavan, S.: Dual-based local search for the connected facility location and related problems. INFORMS J. Comput. 22(4), 584–602 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  9. Cirasella, J., Johnson, D.S., McGeoch, L.A., Zhang, W.: The asymmetric traveling salesman problem: algorithms, instance generators, and tests. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, pp. 32–59. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Acknowledgements

M. Leitner is supported by the Austrian Science Fund (FWF) under grant I892-N23.

Author information

Authors and Affiliations

  1. ISOR, University of Vienna, Vienna, Austria

    Markus Leitner, Ivana Ljubić & Markus Sinnl

  2. DEIOC, Universidad de La Laguna, La Laguna, Spain

    Juan-José Salazar-González

Authors
  1. Markus Leitner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ivana Ljubić
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Juan-José Salazar-González
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Markus Sinnl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Markus Sinnl .

Editor information

Editors and Affiliations

  1. Univ Pierre et Marie Curie LIP6, Paris, France

    Pierre Fouilhoux

  2. Universidade de Lisboa, Lisbon, Portugal

    Luis Eduardo Neves Gouveia

  3. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    A. Ridha Mahjoub

  4. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    Vangelis T. Paschos

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Leitner, M., Ljubić, I., Salazar-González, JJ., Sinnl, M. (2014). On the Asymmetric Connected Facility Location Polytope. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09174-7_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09173-0

  • Online ISBN: 978-3-319-09174-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation