Boolean and graph theoretic formulation of the simple plant location problem
By: P.M. Dearing, P.L. Hammer, B. Simeone
Contributors: Hammer, P. L.; Simeone, B.; Naval Postgraduate School (U.S.). Dept. of Operations Research
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1987
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 17
Subjects: POSITION(LOCATION); FORMULATIONS; INDUSTRIAL PLANTS
Other titles: NPS-55-87-007.
Description: 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)
Notes: Title from cover.

"NPS-55-87-007."

"August 1987."

AD A184 702.

Includes bibliographical references (p. 17).

aq/aq cc:9116 04/23/98