Solving Integer Programs with Enumeration Cuts

Simple item page
dc.contributor.authorBoyd, E. Andrew
dc.date.accessioned2018-06-18T17:39:38Z
dc.date.available2018-06-18T17:39:38Z
dc.date.issued1992-03
dc.date.noteMarch 1992
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%.
dc.format.extent24 pp
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>.
dc.identifier.digitalTR92-08
dc.identifier.urihttps://hdl.handle.net/1911/101748
dc.language.isoeng
dc.titleSolving Integer Programs with Enumeration Cuts
dc.typeTechnical report
dc.type.dcmiText
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
CAAM Technical Reports