A Pseudopolynomial Network Flow Formulation for Exact Knapsack Separation

Simple item page
dc.contributor.authorBoyd, E. Andrewen_US
dc.date.accessioned2018-06-18T17:30:44Zen_US
dc.date.available2018-06-18T17:30:44Zen_US
dc.date.issued1991-03en_US
dc.date.noteMarch 1991en_US
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.en_US
dc.format.extent19 ppen_US
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>.en_US
dc.identifier.digitalTR91-04en_US
dc.identifier.urihttps://hdl.handle.net/1911/101708en_US
dc.language.isoengen_US
dc.titleA Pseudopolynomial Network Flow Formulation for Exact Knapsack Separationen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
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
CMOR Technical Reports