Locating a 1-Center on a Manhattan Plane with “Arbitrarily” Shaped Barriers

Pavankumar Nandikonda, Rajan Batta and Rakesh Nagi ()

Annals of Operations Research, 2003, vol. 123, issue 1, 157-172

Abstract: Barriers commonly occur in practical location and layout problems and are regions where neither travel through nor location of the new facility is permitted. Along the lines of (Larson and Sadiq, 1983) we divide the feasible location region into cells. To overcome the additional complications introduced by the center objective, we develop new analysis and classify cells based on number of cell corners. A procedure to determine the optimal location is established for each class of cells. The overall complexity of the approach is shown to be polynomially bounded. Also, an analogy is drawn to the center problem on a network and generalizations of the model are discussed. Copyright Kluwer Academic Publishers 2003

Keywords: barrier; center problem; location (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1026175313503 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:123:y:2003:i:1:p:157-172:10.1023/a:1026175313503

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1026175313503

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().