登入選單

返回Google圖書搜尋

Boolean and Graph Theoretic Formulation of the Simple Plant Location Problem

P. M. Dearing

出版	Defense Technical Information Center, 1987
URL	http://books.google.com.hk/books?id=jIr_NwAACAAJ&hl=&source=gbs_api

註釋

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).