Conditional Minisum and Minimax Location-Allocation Problems in Euclidean Space

Reuven Chen
Additional contact information
Reuven Chen: Tel Aviv University, Tel Aviv, Israel

Transportation Science, 1988, vol. 22, issue 2, 157-160

Abstract: The problems of minimax and minisum location-allocation in two-dimensional Euclidean space, where some fixed service centers already exist in the area in question, are treated. The method utilized is an extension to a previously reported algorithm for the solution of the unconditional problem and yields good local minima. In the minisum problem this is at the moment the only feasible way to obtain any solutions. In the minimax case, a method for finding optimal solutions has been developed in parallel. However, the latter can yield results only to problems of limited size. A possible combination of the two methods is suggested.

Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.22.2.157 (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:ortrsc:v:22:y:1988:i:2:p:157-160

Access Statistics for this article

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