Boolean and Graph Theoretic Formulation of the Simple Plant Location Problem.
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
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
- Operations Research
- Manufacturing and Industrial Engineering and Control of Production Systems