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