Boolean and graph theoretic formulation of the simple plant location problem
MetadataShow full item record
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)
NPS Report NumberNPS-55-87-007
Showing items related by title, author, creator and subject.
Agrawal, B.N. (1993);This paper presents a boundary-layer model to predict dynamic characteristics of liquid motion in partially filled tanks of a spinning spacecraft. The solution is obtained by solving three boundary-value problems: an ...
Schwartz, Garry S. (Monterey, California. Naval Postgraduate School, 1993-03);This thesis addresses two problems in aligning the recruiting structure for Navy Recruiting Command. The first problem involves two decisions affecting recruiting stations within a single recruiting district: which stations ...
On partitioning an arbitrarily given set of elements of a finite Boolean algebra into the minimum number of sets of compatible elements Colwell, Samuel C., III (Monterey, California. Naval Postgraduate School, 1964);During the past several years at the United States Naval Postgraduate School there has been much interest in obtaining an efficient method for making a time schedule for classes. A mathematical model for a simplified ...