Reducing the Chvátal rank through binarization

DOI10.1016/J.ORL.2024.107119MaRDI QIDQ6988644zbMATH OpenFDO

Authors Gérard Cornuéjols

Publication date 3 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107119

zbMATH Keywords

binarizationChvátal rankextended formulation

Mathematics Subject Classification ID

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

Cites work

• 0/1 polytopes with quadratic Chvátal rank
• ``Binarize and project to generate cuts for general mixed-integer programs
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Binary extended formulations and sequential convexification
• Binary extended formulations of polyhedral mixed-integer sets
• Bounds on the Chvatal rank of polytopes in the 0/1-cube
• Edmonds polytopes and a hierarchy of combinatorial problems
• Geometry of numbers. In two parts, II (last part).
• scientific article; zbMATH DE number 3062447 (Why is no real title available?)
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• On Cutting Planes
• On cutting-plane proofs in combinatorial optimization
• On the Chvátal rank of polytopes in the 0/1 cube
• On the complexity of cutting-plane proofs
• On the existence of optimal solutions to integer and mixed-integer programming problems
• On the rank of cutting-plane proof systems
• The subspace flatness conjecture and faster integer programming

This page was built for publication: Reducing the Chvátal rank through binarization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988644)