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

DOI10.1287/TRSC.26.4.352MaRDI QIDQ4024323zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Location problems
• Geometric complexity of some location problems
• scientific article; zbMATH DE number 3950165
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• On the Complexity of Some Common Geometric Location Problems

Cited in

(16)

• scientific article; zbMATH DE number 1822170 (Why is no real title available?)
• scientific article; zbMATH DE number 5263334 (Why is no real title available?)
• Robust mean absolute deviation problems on networks with linear vertex weights
• Base Location Problems for Base-Monotone Regions
• Effectiveness-equity models for facility location problems on tree networks
• A generalized model of equality measures in network location problems
• scientific article; zbMATH DE number 1932373 (Why is no real title available?)
• Approximation of solutions for location problems
• Improved algorithms for several network location problems with equality measures.
• Improved complexity bounds for location problems on the real line
• Decomposition of the location problem
• Geometric complexity of some location problems
• On the collection depots location problem
• The maximum absolute deviation measure in location problems on networks
• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
• The effect of consolidated periods in heterogeneous lot-sizing games

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)