Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem

P. M. Dearing, P. L. Hammer and B. Simeone
Additional contact information
P. M. Dearing: Clemson University, Clemson, South Carolina 29631
P. L. Hammer: Rutgers University, New Brunswick, New Jersey 08903
B. Simeone: Universitá di Roma “La Sapienza,” Rome, Italy 00185

Transportation Science, 1992, vol. 26, issue 2, 138-148

Abstract: A formulation of the simple plant location problem as the minimization of a pseudo-Boolean function is transformed into a set covering problem and into a weighted vertex packing problem on a graph, called the “plant location graph.” For the special case of a simple plant location problem derived from a tree network, the plant location graph is shown to be weakly triangulated, so that a maximum weighted vertex packing can be found in polynomial-time by existing algorithms.

Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.26.2.138 (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:26:y:1992:i:2:p:138-148

Access Statistics for this article

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