Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems |
scientific article; zbMATH DE number 7546497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems |
scientific article; zbMATH DE number 7546497 |
Statements
Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (English)
0 references
22 June 2022
0 references
binary quadratic problem
0 references
Dantzig-Wolfe reformulation
0 references
Boolean quadric polytope
0 references
sparse problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.743199348449707
0 references
0.7390902042388916
0 references
0.7382610440254211
0 references
0.7373443245887756
0 references
0.7358981966972351
0 references
