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

Minimax problems in mathematical programming (90C47) Discrete location and assignment (90B80)

Related Items (18)

On the planar piecewise quadratic 1-center problem ⋮ Heuristics for a continuous multi-facility location problem with demand regions ⋮ Minisum location problem with farthest Euclidean distances ⋮ The maximin line problem with regional demand ⋮ The optimal solution set of the multi-source Weber problem ⋮ Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ Location Science in Canada ⋮ A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ A biobjective approach to recoverable robustness based on location planning ⋮ Continuous location model of a rectangular barrier facility ⋮ On the structure of the solution set for the single facility location problem with average distances ⋮ 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 ⋮ A minisum location problem with regional demand considering farthest Euclidean distances ⋮ The single facility location problem with average-distances

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Locating facilities by minimax relative to closest points of demand areas