IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v51y2012i1p387-409.html
   My bibliography  Save this article

Semi-Lagrangian relaxation applied to the uncapacitated facility location problem

Author

Listed:

Abstract

No abstract is available for this item.

Suggested Citation

  • C. Beltran-Royo & J.-P. Vial & A. Alonso-Ayuso, 2012. "Semi-Lagrangian relaxation applied to the uncapacitated facility location problem," Computational Optimization and Applications, Springer, vol. 51(1), pages 387-409, January.
  • Handle: RePEc:spr:coopap:v:51:y:2012:i:1:p:387-409
    DOI: 10.1007/s10589-010-9338-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-010-9338-2
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mercedes Landete & Alfredo Marín, 2009. "New facets for the two-stage uncapacitated facility location polytope," Computational Optimization and Applications, Springer, vol. 44(3), pages 487-519, December.
    2. Ghosh, Diptesh, 2003. "Neighborhood search heuristics for the uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 150(1), pages 150-162, October.
    3. Guignard, Monique, 1988. "A Lagrangean dual ascent algorithm for simple plant location problems," European Journal of Operational Research, Elsevier, vol. 35(2), pages 193-200, May.
    4. Mladenovic, N. & Brimberg, J. & Hansen, P., 2006. "A note on duality gap in the simple plant location problem," European Journal of Operational Research, Elsevier, vol. 174(1), pages 11-22, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Belik, Ivan & Jörnsten, Kurt, 2014. "A New Semi-Lagrangean Relaxation for the K-Cardinality Assignment Problem," Discussion Papers 2014/1, Norwegian School of Economics, Department of Business and Management Science.
    2. Letchford, Adam N. & Miller, Sebastian J., 2014. "An aggressive reduction scheme for the simple plant location problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 674-682.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:51:y:2012:i:1:p:387-409. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.