The Solution of Distance Constrained Mini-Sum Location Problems

DOI10.1287/OPRE.33.4.784MaRDI QIDQ3686392zbMATH OpenOpenAlexFDO

Authors C. D. T. Watson-Gandy

Publication date 1985

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.33.4.784

zbMATH Keywords

distance constrained mini-sum locationgraph-coloring algorithmiterative location procedurelocation-allocation problemmultiple facilities locationpartial enumerative proceduresum of weighted distances

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Applications of mathematical programming (90C90)

Recommendations

• The multi-facility min-max Weber problem
• scientific article; zbMATH DE number 849074
• An Analysis of Network Location Problems with Distance Constraints
• scientific article; zbMATH DE number 1138452
• The Minisum and Minimax Location Problems Revisited

Cited in

(11)

• On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
• Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances
• The minimum equitable radius location problem with continuous demand
• A minisum location problem with regional demand considering farthest Euclidean distances
• The weighted minimax location problem with set-up costs and extensions
• The Minisum and Minimax Location Problems Revisited
• A squared-euclidean distance location-allocation problem
• MINIMAX LOCATION PROBLEM WITH A-DISTANCE
• Quality locations for the constrained minimax location model
• The multi-facility min-max Weber problem
• Minisum location problem with farthest Euclidean distances

This page was built for publication: The Solution of Distance Constrained Mini-Sum Location Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686392)