The multi-facility min-max Weber problem

DOI10.1016/0377-2217(84)90259-5zbMath0542.90033OpenAlexW1994453493MaRDI QIDQ795710

C. D. T. Watson-Gandy

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90259-5

zbMATH Keywords

minimaxalgorithmgraph colouringcombinatorial analysismodified bisection searchfacilities locationdissection searchmaximum weighted distancemulti-facility min-max Weber problem

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (1)

New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for the minimax Weber problem
• The Solution of Distance Constrained Mini-Sum Location Problems
• Constrained Location and the Weber-Rawls Problem
• Single Facility $l_p $-Distance Minimax Location
• An Analysis of Private and Public Sector Location Models
• Chromatic Scheduling and the Chromatic Number Problem

This page was built for publication: The multi-facility min-max Weber problem