MaxSAT-Based Cutting Planes for Learning Graphical Models

DOI10.1007/978-3-319-18008-3_24zbMath1459.68193OpenAlexW2296534499MaRDI QIDQ5741478

Matti Järvisalo, Brandon Malone, Paul Saikko

Publication date: 25 July 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-18008-3_24

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probabilistic graphical models (62H22)

Related Items

An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses, LMHS: A SAT-IP Hybrid MaxSAT Solver