Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145)
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: Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem |
scientific article; zbMATH DE number 6107586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem |
scientific article; zbMATH DE number 6107586 |
Statements
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (English)
0 references
15 November 2012
0 references
column generation
0 references
Lagrangian decomposition
0 references
quadratic programming
0 references
0 references
0 references
0 references
0 references
0.9357925057411194
0 references
0.8855332136154175
0 references
0.8121573328971863
0 references
0.7692719101905823
0 references
