Locating facilities by minimax relative to closest points of demand areas

DOI10.1016/S0305-0548(00)00106-4zbMath1001.90042WikidataQ126421644 ScholiaQ126421644MaRDI QIDQ5959386

No author found.

Publication date: 3 April 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

minimax location problem

Mathematics Subject Classification ID

90C47: Minimax problems in mathematical programming

90B80: Discrete location and assignment

Related Items

Heuristics for a continuous multi-facility location problem with demand regions, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, Continuous location model of a rectangular barrier facility, On the structure of the solution set for the single facility location problem with average distances, Minisum location problem with farthest Euclidean distances, The maximin line problem with regional demand, The single facility location problem with average-distances, Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods, An algorithm for generalized constrained multi-source Weber problem with demand substations, A biobjective approach to recoverable robustness based on location planning, Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances, Solving \(k\)-center problems involving sets based on optimization techniques, On the planar piecewise quadratic 1-center problem, The optimal solution set of the multi-source Weber problem, A minisum location problem with regional demand considering farthest Euclidean distances

Cites Work

• Unnamed Item
• Unnamed Item
• The Weber problem with regional demand
• Location of regional facilities
• Replacing continuous demand with discrete demand in a competitive location model
• The generalized Weber problem with expected distances
• Location of facilities with rectangular distances among point and area destinations