IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/1295.html
   My bibliography  Save this paper

Capacitated facility location: valid inequalities and facets

Author

Listed:
  • AARDAL, K.
  • POCHET, Y.
  • WOLSEY, L. A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Aardal, K. & Pochet, Y. & Wolsey, L. A., 1995. "Capacitated facility location: valid inequalities and facets," LIDAM Reprints CORE 1295, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:1295
    DOI: 10.1287/moor.20.3.562
    Note: In : Mathematics of Operations Research, 20 (3), 562--582, 1995
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.20.3.562
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.20.3.562?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    2. Retsef Levi & Andrea Lodi & Maxim Sviridenko, 2008. "Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 461-474, May.
    3. Sherali, Hanif D. & Lee, Youngho & Park, Taehyung, 2000. "New modeling approaches for the design of local access transport area networks," European Journal of Operational Research, Elsevier, vol. 127(1), pages 94-108, November.
    4. Balakrishnan, Anantaram & Karsten, Christian Vad, 2017. "Container shipping service selection and cargo routing with transshipment limits," European Journal of Operational Research, Elsevier, vol. 263(2), pages 652-663.
    5. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2018. "The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 143-184, June.
    6. Hanif D. Sherali & Taehyung Park, 2000. "Discrete equal‐capacity p‐median problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 166-183, March.
    7. Pasquale Avella & Maurizio Boccia, 2009. "A cutting plane algorithm for the capacitated facility location problem," Computational Optimization and Applications, Springer, vol. 43(1), pages 39-65, May.
    8. Sankaran, Jayaram K., 2007. "On solving large instances of the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 178(3), pages 663-676, May.
    9. Andreas Klose & Andreas Drexl, 2005. "Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation," Management Science, INFORMS, vol. 51(11), pages 1689-1705, November.
    10. 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.
    11. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Stefan Gollowitzer & Bernard Gendron & Ivana Ljubić, 2013. "A cutting plane algorithm for the Capacitated Connected Facility Location Problem," Computational Optimization and Applications, Springer, vol. 55(3), pages 647-674, July.
    13. Avella, P. & Boccia, M. & Mattia, S. & Rossi, F., 2021. "Weak flow cover inequalities for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 289(2), pages 485-494.
    14. Zhi-Hai Zhang & Gemma Berenguer & Zuo-Jun (Max) Shen, 2015. "A Capacitated Facility Location Model with Bidirectional Flows," Transportation Science, INFORMS, vol. 49(1), pages 114-129, February.
    15. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2017. "Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design," Transportation Science, INFORMS, vol. 51(2), pages 650-667, May.
    16. Rajgopal, Jayant & Wang, Zhouyan & Schaefer, Andrew J. & Prokopyev, Oleg A., 2011. "Integrated design and operation of remnant inventory supply chains under uncertainty," European Journal of Operational Research, Elsevier, vol. 214(2), pages 358-364, October.
    17. 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.
    18. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.

    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:cor:louvrp:1295. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    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.