An iterative algorithm for the multifacility minimax location problem with euclidean distances

Christakis Charalambous

Naval Research Logistics Quarterly, 1981, vol. 28, issue 2, 325-337

Abstract: An iterative solution method is presented for solving the multifacility location problem with Euclidean distances under the minimax criterion. The iterative procedure is based on the transformation of the multifacility minimax problem into a sequence of squared Euclidean minisum problems which have analytical solutions. Computational experience with the new method is also presented.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800280214

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:wly:navlog:v:28:y:1981:i:2:p:325-337

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().