A new bounding method for single facility location models
From MaRDI portal
Publication:920023
DOI10.1007/BF02097798zbMath0707.90069MaRDI QIDQ920023
Paul D. Dowling, Love, Robert F.
Publication date: 1989
Published in: Annals of Operations Research (Search for Journal in Brave)
Continuous location (90B85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (5)
On the conditional \(p\)-median problem ⋮ On solving unreliable planar location problems ⋮ The convergence of the Weiszfeld algorithm ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions ⋮ A generalization of the rectangular bounding method for continuous location models
Cites Work
- On a rational stopping rule for facilities location algorithms
- The p-Centre Problem-Heuristic and Optimal Algorithms
- Location-Allocation Problems
- Fixed Point Optimality Criteria for the Location Problem with Arbitrary Norms
- Properties and Solution Methods for Large Location-Allocation Problems
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Heuristic Methods for Location-Allocation Problems
- Bounding methods for facilities location algorithms
- Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
- Location Theory, Dominance, and Convexity
This page was built for publication: A new bounding method for single facility location models
