Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving

DOI10.1007/978-3-642-13520-0_3zbMath1285.68166OpenAlexW1526604233MaRDI QIDQ3569913

Peter J. Stuckey

Publication date: 22 June 2010

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13520-0_3

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint ⋮ Towards Copeland optimization in combinatorial problems ⋮ Unnamed Item ⋮ Preface ⋮ Explanation-based large neighborhood search ⋮ Finding subgraphs with side constraints

This page was built for publication: Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving