Algorithms for the Simple Plant-Location Problem with Some Side Conditions

Kurt Spielberg
Additional contact information
Kurt Spielberg: IBM Corporation, New York, New York

Operations Research, 1969, vol. 17, issue 1, 85-111

Abstract: The algorithms of this paper belong to the direct-search or implicit-enumeration type. They compare to the recently proposed algorithm of Efroymson and Ray, as does the mixed integer algorithm proposed by C. E. Lemke and the author to that of Land and Doig. The general plan of procedure is expected to be equally valid for the capacitated plant-location problem and for transshipment problems with fixed charges; with some of the proposed devices more important for these difficult problems than for the simple plant location problem. Considerable computational experience has been accumulated and is discussed at some length. It suggests that additional work on the construction of “adaptive” programs, matching algorithm to data structure, is desirable.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.1.85 (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:17:y:1969:i:1:p:85-111

Access Statistics for this article

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