A Branch-Bound Algorithm for Plant Location

M. A. Efroymson and T. L. Ray
Additional contact information
M. A. Efroymson: Esso Research and Engineering Company, Florham Park, New Jersey
T. L. Ray: Esso Research and Engineering Company, Florham Park, New Jersey

Operations Research, 1966, vol. 14, issue 3, 361-368

Abstract: This paper discusses an integer-programming method for solving a special class of discrete programming problems called plant location. The basic contribution is that the problem is formulated as an integer program in such a way that the associated continuous problem can be efficiently optimized. A branch-bound algorithm is then used to solve the problem. The method discussed in the article has been successfully used to solve “practical” location problems with upwards of fifty plants.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (28)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.3.361 (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:oropre:v:14:y:1966:i:3:p:361-368

Access Statistics for this article

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