Technical Note—On the Complexity of Some Classes of Location Problems

DOI10.1287/TRSC.26.4.352zbMath0758.90055OpenAlexW2151335219MaRDI QIDQ4024323

Arie Tamir

Publication date: 25 February 1993

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

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

zbMATH Keywords

maximal direct covering tree problem1-center retilinear asymmetric distance locationcomplexity bound improvementsequity maximizing facility locationplanar 1-center rectilinear roundtrip location model

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

The effect of consolidated periods in heterogeneous lot-sizing games ⋮ Robust mean absolute deviation problems on networks with linear vertex weights ⋮ Improved algorithms for several network location problems with equality measures. ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ A generalized model of equality measures in network location problems ⋮ On the collection depots location problem ⋮ The maximum absolute deviation measure in location problems on networks ⋮ Effectiveness-equity models for facility location problems on tree networks

This page was built for publication: Technical Note—On the Complexity of Some Classes of Location Problems