One-facility location with rectilinear tour distances

DOI10.1002/nav.3800320304zbMath0579.90026OpenAlexW2000429790MaRDI QIDQ3703612

No author found.

Publication date: 1985

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800320304

zbMATH Keywords

medianmultimodalbounded heuristicone-facility locationrectilinear tour distances

Mathematics Subject Classification ID

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

Related Items (12)

Efficient algorithms for the round-trip 1-center and 1-median problems ⋮ The collection depots location problem on networks ⋮ On the planar piecewise quadratic 1-center problem ⋮ Heuristics and bounds for the travelling salesman location problem on the plane ⋮ Location‐routing problem: a classification of recent research ⋮ The Hamiltonian p-median problem ⋮ On the collection depots location problem ⋮ Special issue on Locational analysis ⋮ Location of rectilinear center trajectories ⋮ Combined location-routing problems: A synthesis and future research directions ⋮ One-way and round-trip center location problems ⋮ A taxonomical analysis, current methods and objectives on location-routing problems

This page was built for publication: One-facility location with rectilinear tour distances