Note on a Rectilinear Distance Round-Trip Location Problem

DOI10.1287/TRSC.19.1.84zbMATH Open0618.90031OpenAlexW2019882657MaRDI QIDQ3755209FDOQ3755209

Toshio Nishida, Tetsuo Ichimori

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.84

Recommendations

• On the rectangularp-center problem
• Efficient algorithms for the round-trip 1-center and 1-median problems
• An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
• A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES
• scientific article

zbMATH Keywords

rectilinear distance round-trip location problem

Mathematics Subject Classification ID

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

Cited In (1)

• A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES

This page was built for publication: Note on a Rectilinear Distance Round-Trip Location Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755209)