Solving Structured Multifacility Location Problems Efficiently

Dilip Chhajed and Timothy J. Lowe
Additional contact information
Dilip Chhajed: Department of Business Administration, University of Illinois at Urbana-Champaign, Champaign, Illinois 61820
Timothy J. Lowe: Department of Management Sciences, University of Iowa, Iowa City, Iowa 52242

Transportation Science, 1994, vol. 28, issue 2, 104-115

Abstract: A generic multifacility location problem is considered which subsumes, as special cases, several NP-hard location problems that have appeared in literature. A unified algorithm is presented which solves the generic problem in polynomial time when problem structure, as defined by interactions between pairs of facilities, satisfies certain properties.

Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.28.2.104 (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:28:y:1994:i:2:p:104-115

Access Statistics for this article

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