Open AccessTechnical Note—On the Complexity of Some Classes of Location Problems
Author(s) -
Arie Tamir
Publication year - 1992
Publication title -
transportation science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.965
H-Index - 115
eISSN - 1526-5447
pISSN - 0041-1655
DOI - 10.1287/trsc.26.4.352
Subject(s) - facility location problem , center (category theory) , location model , 1 center problem , tree (set theory) , location theory , computer science , mathematics , mathematical optimization , geography , operations research , combinatorics , economic geography , chemistry , crystallography
We present complexity bound improvements for four location models: the planar 1-center rectilinear roundtrip location model, the 1-center rectilinear asymmetric distance location model, the equity maximizing facility location model, and the maximal direct covering tree problem.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom