Achieving consistency with cutting planes

DOI10.1007/s10107-022-01778-8OpenAlexW4213062745MaRDI QIDQ2687054

Danial Davarnia, Atefeh Rajabalizadeh, John N. Hooker

Publication date: 1 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-022-01778-8

zbMATH Keywords

integer programmingconsistencybranch-and-boundcutting planesconstraint programming

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Mathematical programming (90Cxx) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Uses Software

• MIPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Projection, consistency, and George Boole
• On the complexity of cutting-plane proofs
• Integrated methods for optimization
• A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF
• Generalized resolution for 0--1 linear inequalities
• Logic-based Benders decomposition
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
• A status report on conflict analysis in mixed integer nonlinear programming
• Consistency for \(0-1\) programming
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Conflict analysis in mixed integer programming
• Gomory cuts revisited
• Logic, Optimization, and Constraint Programming
• Integer Programming
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A Way to Simplify Truth Functions
• An Automatic Method of Solving Discrete Programming Problems
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• A Sufficient Condition for Backtrack-Free Search
• Input Proofs and Rank One Cutting Planes
• Disjunctive Programming
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• A Computational Study of Search Strategies for Mixed Integer Programming
• The Unit Proof and the Input Proof in Theorem Proving
• The Problem of Simplifying Truth Functions