Technical Note---A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree

Igor Averbakh and Oded Berman
Additional contact information
Igor Averbakh: Department of Mathematics, Western Washington University, Bellingham, Washington 98225
Oded Berman: The Faculty of Management, University of Toronto, Toronto, Ontario M5S 1V4, Canada

Transportation Science, 1996, vol. 30, issue 3, 261-269

Abstract: The problem of locating p distinguishable facilities on a tree network with n nodes, subject to interfacility distance constraints, is considered. Each facility must be located within its own feasible region, that is selected in advance based on previous analysis. The main difference from the variants of the problem studied earlier is that more general feasible regions are allowed. A sequential location scheme for solving the problem is formulated, and sufficient conditions for the applicability of the scheme are presented. For the special case where the feasible regions are finite (sets of selected nodes of the tree), it is demonstrated that the sufficient conditions can be checked in O ( pn ) time; if they hold, the sequential location scheme can be implemented in O ( np 2 ) time (for the case of finite feasible regions).

Date: 1996
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.30.3.261 (application/pdf)

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:inm:ortrsc:v:30:y:1996:i:3:p:261-269

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().