Bounding methods for facilities location algorithms

DOI10.1002/NAV.3800330420zbMATH Open0614.90052OpenAlexW2018211812MaRDI QIDQ4723554FDOQ4723554

Robert F. Love, Paul D. Dowling

Publication date: 1986

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11375/5450

zbMATH Keywords

facilities locationbounding methodmultifacility problems\(\ell _ p\) distances

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Cited In (11)

• A generalization of the rectangular bounding method for continuous location models
• Line Segment Facility Location in Weighted Subdivisions
• Title not available (Why is that?)
• 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
• 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

   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 👍 👎

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)