Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7471952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search |
scientific article; zbMATH DE number 7471952 |
Statements
Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (English)
0 references
10 February 2022
0 references
pseudo-Boolean
0 references
conflict-driven search
0 references
cutting plane proofs
0 references
integer programming
0 references
linear programming
0 references
cut generation
0 references
RoundingSat
0 references
0 references
0 references
0.8269742727279663
0 references
0.7732664346694946
0 references
0.7719182372093201
0 references
0.7636181712150574
0 references
