The triangle closure is a polyhedron
- 23 February 2013
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 145 (1-2) , 19-58
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- On finitely generated closures in the theory of cutting planesDiscrete Optimization, 2012
- Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension ThreeMathematics of Operations Research, 2011
- Maximal Lattice-Free Convex Sets in Linear SubspacesMathematics of Operations Research, 2010
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex SetsMathematics of Operations Research, 2010
- Minimal Valid Inequalities for Integer ConstraintsMathematics of Operations Research, 2009
- On the relative strength of split, triangle and quadrilateral cutsMathematical Programming, 2009
- Inequalities from Two Rows of a Simplex Tableau2007
- On integer points in polyhedraCombinatorica, 1992
- Chvátal closures for mixed integer programming problemsMathematical Programming, 1990
- Intersection Cuts—A New Type of Cutting Planes for Integer ProgrammingOperations Research, 1971