Bounding methods for facilities location algorithms
From MaRDI portal
Recommendations
- Technical Note—A Generalized Bounding Method for Multifacility Location Models
- A new bounding method for single facility location models
- A generalization of the rectangular bounding method for continuous location models
- On a rational stopping rule for facilities location algorithms
- Fast bounding procedures for large instances of the simple plant location problem
Cited in
(14)- Fast bounding procedures for large instances of the simple plant location problem
- A generalization of the rectangular bounding method for continuous location models
- Line Segment Facility Location in Weighted Subdivisions
- scientific article; zbMATH DE number 2086226 (Why is no real title available?)
- Computation of lower bounds on the network cost in location problems subject to distance constraints
- On solving unreliable planar location problems
- On a rational stopping rule for facilities location algorithms
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions
- An approximation framework for bounded facility location problems
- Technical Note—A Generalized Bounding Method for Multifacility Location Models
- A new bounding method for single facility location models
- On the conditional \(p\)-median problem
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Borda winner in facility location problems on sphere
This page was built for publication: Bounding methods for facilities location algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723554)
