An Efficient Branch and Bound Algorithm for the Warehouse Location Problem

Basheer M. Khumawala
Additional contact information
Basheer M. Khumawala: University of North Carolina, Chapel Hill

Management Science, 1972, vol. 18, issue 12, B718-B731

Abstract: This paper introduces an efficient branch and bound algorithm for a special class of mixed integer programming problems called the warehouse location problem. A set of branching decision rules is proposed for selecting warehouses to be constrained open and closed from any node of the branch and bound tree. These rules are tested for their efficiency in reducing computation times and storage requirements to reach optimal solutions. An improved method of solving the linear programming problems at the nodes which substantially reduces the computations is also introduced in this paper.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (25)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.12.B718 (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:18:y:1972:i:12:p:b718-b731

Access Statistics for this article

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