Heuristic solution of the multisource Weber problem as a p-median problem
- 1 March 1998
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 22 (2-3) , 55-62
- https://doi.org/10.1016/s0167-6377(98)00004-2
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Variable neighborhood search for the p-medianLocation Science, 1997
- A new adaptive multi-start technique for combinatorial global optimizationsOperations Research Letters, 1994
- A projection method forl p norm location-allocation problemsMathematical Programming, 1994
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp DistancesOperations Research, 1993
- A comparison of two dual-based procedures for solving the p-median problemEuropean Journal of Operational Research, 1985
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean DistancesSIAM Journal on Scientific and Statistical Computing, 1980
- An Algorithmic Approach to Network Location Problems. II: Thep-MediansSIAM Journal on Applied Mathematics, 1979
- Exact and approximate solutions to the multisource weber problemMathematical Programming, 1972
- Heuristic Methods for Location-Allocation ProblemsSIAM Review, 1964
- Location-Allocation ProblemsOperations Research, 1963