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

Published Online:https://doi.org/10.1287/trsc.26.4.352

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.