IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v54y2006i1p73-81.html
   My bibliography  Save this article

Approximation Algorithms for Problems Combining Facility Location and Network Design

Author

Listed:
  • R. Ravi

    (David A. Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

  • Amitabh Sinha

    (Stephen M. Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109)

Abstract

We present approximation algorithms for integrated logistics problems that combine elements of facility location and transport network design. We first study the problem where opening facilities incurs opening costs and transportation from the clients to the facilities incurs buy-at-bulk costs, and provide a combinatorial approximation algorithm. We also show that the integer-programming formulation of this problem has small integrality gap. We extend the model to the version when there is a bound on the number of facilities that may be opened.

Suggested Citation

  • R. Ravi & Amitabh Sinha, 2006. "Approximation Algorithms for Problems Combining Facility Location and Network Design," Operations Research, INFORMS, vol. 54(1), pages 73-81, February.
    • Handle: RePEc:inm:oropre:v:54:y:2006:i:1:p:73-81
    DOI: 10.1287/opre.1050.0228
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1050.0228
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1050.0228?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. Lai, Xiaofan & Xu, Zhou, 2016. "Improved algorithms for joint optimization of facility locations and network connections," European Journal of Operational Research, Elsevier, vol. 250(3), pages 745-753.
    2. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    3. Cocking, Cara & Flessa, Steffen & Reinelt, Gerhard, 2012. "Improving access to health facilities in Nouna district, Burkina Faso," Socio-Economic Planning Sciences, Elsevier, vol. 46(2), pages 164-172.
    4. Ashwin Arulselvan & Mohsen Rezapour, 2017. "Exact Approaches for Designing Multifacility Buy-at-Bulk Networks," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 597-611, November.
    5. Tobias Harks & Felix G König & Jannik Matuschke, 2013. "Approximation Algorithms for Capacitated Location Routing," Transportation Science, INFORMS, vol. 47(1), pages 3-22, February.
    6. Carrasco Heine, Oscar F. & Demleitner, Antonia & Matuschke, Jannik, 2023. "Bifactor approximation for location routing with vehicle and facility capacities," European Journal of Operational Research, Elsevier, vol. 304(2), pages 429-442.
    7. Tadashi Yamada & Bona Frazila Russ & Jun Castro & Eiichi Taniguchi, 2009. "Designing Multimodal Freight Transport Networks: A Heuristic Approach and Applications," Transportation Science, INFORMS, vol. 43(2), pages 129-143, May.
    8. Matt Bassett & Leslie Gardner, 2013. "Designing optimal global supply chains at Dow AgroSciences," Annals of Operations Research, Springer, vol. 203(1), pages 187-216, March.
    9. Hakim Akeb & Mhand Hifi, 2010. "A hybrid beam search looking-ahead algorithm for the circular packing problem," Journal of Combinatorial Optimization, Springer, vol. 20(2), pages 101-130, August.
    10. Wei Ding & Ke Qiu, 2018. "A quadratic time exact algorithm for continuous connected 2-facility location problem in trees," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1262-1298, November.

    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:inm:oropre:v:54:y:2006:i:1:p:73-81. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.