An improved bound for the multifacility location model
From MaRDI portal
Publication:1904759
DOI10.1016/0167-6377(95)00016-DzbMath0836.90111OpenAlexW2002971579MaRDI QIDQ1904759
Publication date: 7 January 1996
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(95)00016-d
Cites Work
- Unnamed Item
- On a rational stopping rule for facilities location algorithms
- A quadratically convergent method for minimizing a sum of euclidean norms
- Acceleration of the HAP approach for the multifacility location problem
- A projected newton method forl p norm location problems
- Technical Note—A Generalized Bounding Method for Multifacility Location Models
- Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- A Trajectory Method for the Optimization of the Multi-Facility Location Problem With lp Distances
- The Dual of a Hyperbolic Approximation to the Generalized Constrained Multi-Facility Location Problem with lp, Distances
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
This page was built for publication: An improved bound for the multifacility location model