A branch‐bound algorithm for the capacitated facilities location problem

P. S. Davis and T. L. Ray

Naval Research Logistics Quarterly, 1969, vol. 16, issue 3, 331-344

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.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
https://doi.org/10.1002/nav.3800160306

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:16:y:1969:i:3:p:331-344

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().