Design and Verify: A New Scheme for Generating Cutting-Planes

DOI10.1007/978-3-642-20807-2_12zbMath1339.90239OpenAlexW2177576089MaRDI QIDQ3009757

Sebastian Pokutta, Santanu S. Dey

Publication date: 24 June 2011

Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_12

zbMATH Keywords

integer programmingcutting-planesverification scheme

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (2)

Design and verify: a new scheme for generating cutting-planes ⋮ A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set

Cites Work

• Unnamed Item
• Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• Chvátal closures for mixed integer programming problems
• On cutting-plane proofs in combinatorial optimization
• Bounds on the Chvatal rank of polytopes in the 0/1-cube
• Cutting-plane proofs in polynomial space
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Edmonds polytopes and a hierarchy of combinatorial problems
• Two row mixed-integer cuts via lifting
• On the Matrix-Cut Rank of Polyhedra
• The Chvátal-Gomory Closure of a Strictly Convex Body
• Outline of an algorithm for integer solutions to linear programs
• The Cutting-Plane Method for Solving Convex Programs
• On the Rank of Cutting-Plane Proof Systems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On the rank of mixed 0,1 polyhedra.

This page was built for publication: Design and Verify: A New Scheme for Generating Cutting-Planes