IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v53y1991i1p38-45.html
   My bibliography  Save this article

Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem

Author

Listed:
  • Barcelo, Jaime
  • Fernandez, Elena
  • Jornsten, Kurt O.

Abstract

No abstract is available for this item.

Suggested Citation

  • Barcelo, Jaime & Fernandez, Elena & Jornsten, Kurt O., 1991. "Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 53(1), pages 38-45, July.
  • Handle: RePEc:eee:ejores:v:53:y:1991:i:1:p:38-45
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(91)90091-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

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


    Cited by:

    1. Lim, Gino J. & Sonmez, Ayse Durukan, 2013. "γ-Robust facility relocation problem," European Journal of Operational Research, Elsevier, vol. 229(1), pages 67-74.
    2. Ahuja, R.K. & Orlin, J.B. & Pallottino, S. & Scaparra, M.P. & Scutella, M.G., 2003. "A Multi-Exchange Heuristic For The Single Source Capacitated Facility Location Problem," Working papers 4387-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. Klose, Andreas, 2000. "A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 126(2), pages 408-421, October.
    4. Sridharan, R., 1995. "The capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 87(2), pages 203-213, December.
    5. Hinojosa, Y. & Puerto, J. & Fernandez, F. R., 2000. "A multiperiod two-echelon multicommodity capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 271-291, June.
    6. Dezhi Zhang & Shuxin Yang & Shuangyan Li & Jiajun Fan & Bin Ji, 2020. "Integrated Optimization of the Location–Inventory Problem of Maintenance Component Distribution for High-Speed Railway Operations," Sustainability, MDPI, vol. 12(13), pages 1-25, July.
    7. M T Ramos & J Sáez, 2005. "Solving capacitated facility location problems by Fenchel cutting planes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 297-306, March.
    8. Mohammad M. Fazel-Zarandi & J. Christopher Beck, 2012. "Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 387-398, August.
    9. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    10. Cortinhal, Maria Joao & Captivo, Maria Eugenia, 2003. "Upper and lower bounds for the single source capacitated location problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 333-351, December.
    11. Kocaman, Ayse Selin & Huh, Woonghee Tim & Modi, Vijay, 2012. "Initial layout of power distribution systems for rural electrification: A heuristic algorithm for multilevel network design," Applied Energy, Elsevier, vol. 96(C), pages 302-315.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:53:y:1991:i:1:p:38-45. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.