Boolean and graph theoretic formulation of the simple plant location problem
Loading...
Authors
Dearing, P.
Hammer, P.L.
Simeone B.
Subjects
NA
Advisors
Date of Issue
1987-08
Date
1987-08
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
The simple plant location problem is formulated as the minimization of a pseudo-Boolean functions. This form of the problem is then transformed into a set covering problem and also into a weighted vertex packing problem on a graph. These formulations are compared to similar formulations in the literature and to the 'standard' integer programming formulation. (Author)
Type
Technical Report
Description
Series/Report No
Department
Identifiers
NPS Report Number
NPS-55-87-007
Sponsors
Naval Postgraduate School, Monterey, CA.
Funder
NA
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.