Boyd, E. Andrew2018-06-182018-06-181991-03Boyd, E. Andrew. "A Pseudopolynomial Network Flow Formulation for Exact Knapsack Separation." (1991) <a href="https://hdl.handle.net/1911/101708">https://hdl.handle.net/1911/101708</a>.https://hdl.handle.net/1911/101708The NP-complete separation problem for the knapsack polyhedron P is formulated as a side-constrained network flow problem with a pseudopolynomial number of vertices and edges. It is demonstrated that the primal polyhedron associated with this formulation can be projected onto an appropriate subspace to yield P and that the dual polyhedron can be projected onto an appropriate subspace to yield the polar of P. Practical consequences of the formulation are discussed.19 ppengTechnical reportTR91-04