Technical Note—On the Complexity of Some Classes of Location Problems
DOI10.1287/TRSC.26.4.352zbMATH Open0758.90055OpenAlexW2151335219MaRDI QIDQ4024323FDOQ4024323
Authors: 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
Recommendations
maximal direct covering tree problem1-center retilinear asymmetric distance locationcomplexity bound improvementsequity maximizing facility locationplanar 1-center rectilinear roundtrip location model
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85)
Cited In (16)
- Effectiveness-equity models for facility location problems on tree networks
- 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
- Title not available (Why is that?)
- Geometric complexity of some location problems
- Title not available (Why is that?)
- On the collection depots location problem
- Title not available (Why is that?)
- The effect of consolidated periods in heterogeneous lot-sizing games
- Robust mean absolute deviation problems on networks with linear vertex weights
- Approximation of solutions for location problems
- Improved complexity bounds for location problems on the real line
- Decomposition of the location problem
- Base Location Problems for Base-Monotone Regions
- A generalized model of equality measures in network location problems
- The maximum absolute deviation measure in location problems on networks
This page was built for publication: Technical Note—On the Complexity of Some Classes of Location Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024323)
