A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935)
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: A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs |
scientific article; zbMATH DE number 6836737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs |
scientific article; zbMATH DE number 6836737 |
Statements
A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (English)
0 references
9 February 2018
0 references
quadratic binary programming
0 references
Lagrangian decomposition
0 references
preprocess
0 references
quadratic assignment problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8324816823005676
0 references
0.8121573328971863
0 references
0.7810143828392029
0 references
0.7694319486618042
0 references
0.768612265586853
0 references
