BOOLEAN AND GRAPH THEORETIC FORMULATIONS OF THE SIMPLE PLANT LOCATION PROBLEM
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.
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
-
Corporate Authors:
Operations Research Society of America
1314 Guilford Avenue
Baltimore, MD United States 21202 -
Authors:
- Dearing, P M
- Hammer, P L
- SIMEONE, B
- Publication Date: 1992-5
Media Info
- Features: Figures; References; Tables;
- Pagination: p. 138-148
-
Serial:
- Transportation Science
- Volume: 26
- Issue Number: 2
- Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
- ISSN: 0041-1655
- Serial URL: http://transci.journal.informs.org/
Subject/Index Terms
- TRT Terms: Algorithms; Mathematical models; Plant location; Polynomials; Trees (Mathematics)
- Subject Areas: Design; Highways; Planning and Forecasting; I21: Planning of Transport Infrastructure;
Filing Info
- Accession Number: 00622004
- Record Type: Publication
- Files: TRIS
- Created Date: May 31 1992 12:00AM