Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search

Conflict-driven pseudo-Boolean solvers optimize 0-1 integer linear programs by extending the conflict-driven clause learning (CDCL) paradigm from SAT solving. Though pseudo-Boolean solvers have the potential to be exponentially more efficient than CDCL solvers in theory, in practice they can sometim...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Constraints : an international journal Ročník 26; číslo 1-4; s. 26 - 55
Hlavní autori: Devriendt, Jo, Gleixner, Ambros, Nordström, Jakob
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.10.2021
Springer Nature B.V
Predmet:
Artificial Intelligence
Boolean
Boolean algebra
Computer and Information Sciences
Computer Science
Computer Sciences
Data- och informationsvetenskap (Datateknik)
Datavetenskap (Datalogi)
Integer programming
Linear functions
Linear programming
Mixed integer
Natural Sciences
Naturvetenskap
Operations Research
Operations Research/Decision Theory
Optimization
Searching
Solvers
Special Issue on Constraint Programming
Pseudo-Boolean
Conflict-driven search
Integer Programming
RoundingSat
Cut generation
Cutting plane proofs
Linear Programming
ISSN:1383-7133, 1572-9354, 1572-9354
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Conflict-driven pseudo-Boolean solvers optimize 0-1 integer linear programs by extending the conflict-driven clause learning (CDCL) paradigm from SAT solving. Though pseudo-Boolean solvers have the potential to be exponentially more efficient than CDCL solvers in theory, in practice they can sometimes get hopelessly stuck even when the linear programming (LP) relaxation is infeasible over the reals. Inspired by mixed integer programming (MIP), we address this problem by interleaving incremental LP solving with cut generation within the conflict-driven pseudo-Boolean search. This hybrid approach, which for the first time combines MIP techniques with full-blown conflict analysis operating directly on linear inequalities using the cutting planes method, significantly improves performance on a wide range of benchmarks, approaching a “best-of-both-worlds” scenario between SAT-style conflict-driven search and MIP-style branch-and-cut.
Bibliografia:SourceType-Scholarly Journals-1
content type line 14
ObjectType-Editorial-2
ObjectType-Commentary-1
ISSN:1383-7133
1572-9354
1572-9354
DOI:10.1007/s10601-020-09318-x