Fenchel Cutting Planes for Linear Integer Programming Problems
| dc.contributor.author | Boyd, E. Andrew | en_US |
| dc.date.accessioned | 2018-06-18T17:30:09Z | en_US |
| dc.date.available | 2018-06-18T17:30:09Z | en_US |
| dc.date.issued | 1990-10 | en_US |
| dc.date.note | October 1990 | en_US |
| dc.description.abstract | The author recently introduced a new class of cutting planes for integer programs called Fenchel cuts which distinguish themselves from more conventional cuts in that they are generated by directly seeking to solve the separation problem rather than through the use of explicit knowledge of the polyhedral structure of the integer program. The theory of Fenchel cuts is outlined and their polyhedral characteristics are briefly discussed. A general algorithm for generating Fenchel cuts is described and an instantiation of this algorithm is then presented for the separation problem associated with knapsack polyhedra. The paper concludes by provably optimizing a linear function over the intersection of the knapsack polyhedra defined by individual constraints in a collection of integer programs first introduced by Crowder, Johnson, and Padberg. | en_US |
| dc.format.extent | 34 pp | en_US |
| dc.identifier.citation | Boyd, E. Andrew. "Fenchel Cutting Planes for Linear Integer Programming Problems." (1990) <a href="https://hdl.handle.net/1911/101685">https://hdl.handle.net/1911/101685</a>. | en_US |
| dc.identifier.digital | TR90-20 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/101685 | en_US |
| dc.language.iso | eng | en_US |
| dc.title | Fenchel Cutting Planes for Linear Integer Programming Problems | en_US |
| dc.type | Technical report | en_US |
| dc.type.dcmi | Text | en_US |
Files
Original bundle
1 - 1 of 1