A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances

There is a rapidly growing interdisciplinary interest in the application of location models to real life problems. Unfortunately, the current methods used to solve the most popular minisum and minimax location problems are computationally inadequate. A more unified and numerically stable approach fo...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on scientific and statistical computing 1980-12, Vol.1 (4), p.512-526
Main Authors: Calamai, P. H., Conn, A. R.
Format: Article
Language:English
Subjects:
Algorithms
Linear algebra
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:There is a rapidly growing interdisciplinary interest in the application of location models to real life problems. Unfortunately, the current methods used to solve the most popular minisum and minimax location problems are computationally inadequate. A more unified and numerically stable approach for solving these problems is proposed. Detailed analysis is done for the linearly constrained Euclidean distance minisum problem for facilities located in a plane. Preliminary computational experience suggests that this approach compares favourably with other methods.
ISSN:0196-5204
1064-8275
2168-3417
1095-7197
DOI:10.1137/0901037