IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v16y1969i3p331-344.html
   My bibliography  Save this article

A branch‐bound algorithm for the capacitated facilities location problem

Author

Listed:
  • P. S. Davis
  • T. L. Ray

Abstract

This paper discusses a mixed integer programming method for solving the Facilities Location Problem with capacities on the facilities. The algorithm uses a Decomposition technique to solve the dual of the associated continuous problem in each branch‐bound iteration. The method was designed to produce the global optimum solution for problems with up to 100 facilities and 1,000 customers. Computational experience and a complete example are also presented in the appendix.

Suggested Citation

  • P. S. Davis & T. L. Ray, 1969. "A branch‐bound algorithm for the capacitated facilities location problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 16(3), pages 331-344, September.
    • Handle: RePEc:wly:navlog:v:16:y:1969:i:3:p:331-344
    DOI: 10.1002/nav.3800160306
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800160306
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800160306?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. Scholl, Joachim & Boysen, Nils & Scholl, Armin, 2023. "E-platooning: Optimizing platoon formation for long-haul transportation with electric commercial vehicles," European Journal of Operational Research, Elsevier, vol. 304(2), pages 525-542.
    2. Maryam Shoaeinaeini & Kannan Govindan & Donya Rahmani, 2022. "Pricing policy in green supply chain design: the impact of consumer environmental awareness and green subsidies," Operational Research, Springer, vol. 22(4), pages 3989-4028, September.
    3. 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.
    4. Ramesh Bollapragada & Uday S. Rao & Junying Wu, 2023. "Hub location–allocation for combined fixed-wireless and wireline broadband access networks," DECISION: Official Journal of the Indian Institute of Management Calcutta, Springer;Indian Institute of Management Calcutta, vol. 50(1), pages 115-128, March.
    5. Farnaz Barzinpour & Peyman Taki, 2018. "A dual-channel network design model in a green supply chain considering pricing and transportation mode choice," Journal of Intelligent Manufacturing, Springer, vol. 29(7), pages 1465-1483, October.
    6. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    7. Philip C. Jones & James L. Zydiak & Wallace J. Hopp, 1991. "Parallel machine replacement," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 351-365, June.
    8. Michael J. Kuby & Jeffrey M. Bielicki & Richard S. Middleton, 2011. "Optimal Spatial Deployment of CO2 Capture and Storage Given a Price on Carbon," International Regional Science Review, , vol. 34(3), pages 285-305, July.

    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:wly:navlog:v:16:y:1969:i:3:p:331-344. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.