On the collection depots location problem

DOI10.1016/S0377-2217(99)00410-5zbMath0981.90040WikidataQ127549895 ScholiaQ127549895MaRDI QIDQ5937712

George O. Wesolowsky, Zvi Drezner

Publication date: 12 July 2001

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

zbMATH Keywords

locationeuclideanrectilinearWeber problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (11)

Efficient algorithms for the round-trip 1-center and 1-median problems ⋮ A fast algorithm for the rectilinear distance location problem ⋮ The planar multifacility collection depots location problem ⋮ The collection depots location problem on networks ⋮ On the planar piecewise quadratic 1-center problem ⋮ When centers can fail: a close second opportunity ⋮ The transfer point location problem ⋮ Balancing the arrival times of users in a two-stage location problem ⋮ Link-based multi-class hazmat routing-scheduling problem: a multiple demon approach ⋮ Collection depots facility location problems in trees ⋮ Single facility collection depots location problem in the plane

Cites Work

• Unnamed Item
• A multi-objective heuristic approach for the casualty collection points location problem
• One-facility location with rectilinear tour distances
• 0(N log N) Algorithm for the Rectilinear Round-Trip Location Problem
• Location-Allocation Problems
• Technical Note—On the Complexity of Some Classes of Location Problems
• Heuristic Methods for Location-Allocation Problems

This page was built for publication: On the collection depots location problem