Solving Integer Programs with Enumeration Cuts

Simple item page
dc.contributor.authorBoyd, E. Andrewen_US
dc.date.accessioned2018-06-18T17:39:38Zen_US
dc.date.available2018-06-18T17:39:38Zen_US
dc.date.issued1992-03en_US
dc.date.noteMarch 1992en_US
dc.description.abstractA cutting plane technique with applicability to the solution of general integer programs is presented and the computational value of this technique is demonstrated by applying it to a collection of seven difficult integer programs arising from real-world applications. Four of the seven problems are solved to optimality without the aid of branch and bound, and six of the seven problems have the gap between the value of the integer program and its linear programming relaxation closed by over 98%.en_US
dc.format.extent24 ppen_US
dc.identifier.citationBoyd, E. Andrew. "Solving Integer Programs with Enumeration Cuts." (1992) <a href="https://hdl.handle.net/1911/101748">https://hdl.handle.net/1911/101748</a>.en_US
dc.identifier.digitalTR92-08en_US
dc.identifier.urihttps://hdl.handle.net/1911/101748en_US
dc.language.isoengen_US
dc.titleSolving Integer Programs with Enumeration Cutsen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR92-08.pdf
Size:
213.39 KB
Format:
Adobe Portable Document Format
Download
Collections
CMOR Technical Reports