A Pseudopolynomial Network Flow Formulation for Exact Knapsack Separation

Simple item page
dc.contributor.authorBoyd, E. Andrew
dc.date.accessioned2018-06-18T17:30:44Z
dc.date.available2018-06-18T17:30:44Z
dc.date.issued1991-03
dc.date.noteMarch 1991
dc.description.abstractThe 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.
dc.format.extent19 pp
dc.identifier.citationBoyd, 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>.
dc.identifier.digitalTR91-04
dc.identifier.urihttps://hdl.handle.net/1911/101708
dc.language.isoeng
dc.titleA Pseudopolynomial Network Flow Formulation for Exact Knapsack Separation
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR91-04.pdf
Size:
211.64 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports