The Solution of Distance Constrained Mini-Sum Location Problems

DOI10.1287/OPRE.33.4.784zbMath0569.90020OpenAlexW1974477121MaRDI QIDQ3686392

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

location-allocation problemsum of weighted distancesgraph-coloring algorithmdistance constrained mini-sum locationiterative location proceduremultiple facilities locationpartial enumerative procedure

Mathematics Subject Classification ID

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

Related Items (1)

The multi-facility min-max Weber problem

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