0(N log N) Algorithm for the Rectilinear Round-Trip Location Problem

DOI10.1287/trsc.19.1.91zbMath0606.90040OpenAlexW2033832425MaRDI QIDQ3745586

Zvi Drezner

Publication date: 1985

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.19.1.91

zbMATH Keywords

rectilinear round-trip location problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Related Items (2)

On the collection depots location problem ⋮ A taxonomical analysis, current methods and objectives on location-routing problems

This page was built for publication: 0(N log N) Algorithm for the Rectilinear Round-Trip Location Problem