An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem

Umit Akinc and Basheer M. Khumawala
Additional contact information
Umit Akinc: Middle East Technical University, Ankara
Basheer M. Khumawala: University of North Carolina

Management Science, 1977, vol. 23, issue 6, 585-594

Abstract: This paper describes an efficient solution procedure for the warehouse location problem in which limitations on the amount of goods which can be handled are also imposed. The proposed branch-and-bound solution method is made efficient by developing dominance, lower and upper bounding procedures and branch and node selection rules utilizing the special structure of this problem. Computational results are provided for large sized problems.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.6.585 (application/pdf)

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:inm:ormnsc:v:23:y:1977:i:6:p:585-594

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().