Resolution meets cutting planes: introducing hypercube linear resolution

DOI10.1007/978-3-032-27242-3_10MaRDI QIDQ7356163zbMATH OpenFDO

Authors Maarten Flippo, Peter J. Stuckey, Emir Demirović

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27242-3_10

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10)

Cites work

• A complete and terminating approach to linear integer solving
• A Computing Procedure for Quantification Theory
• Certified dominance and symmetry breaking for combinatorial optimisation
• Cutting to the chase.
• Extended clause learning
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• IntSat: integer linear programming by conflict-driven constraint learning
• Learning general constraints in CSP
• On handling indicator constraints in mixed integer programming
• Outline of an algorithm for integer solutions to linear programs
• Propagation via lazy clause generation

This page was built for publication: Resolution meets cutting planes: introducing hypercube linear resolution

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