A new algorithm based on Lagrangian relaxation for solving indefinite quadratic integer programming (Q2950853)
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 new algorithm based on Lagrangian relaxation for solving indefinite quadratic integer programming |
scientific article; zbMATH DE number 6492801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm based on Lagrangian relaxation for solving indefinite quadratic integer programming |
scientific article; zbMATH DE number 6492801 |
Statements
9 October 2015
0 references
indefinite quadratic integer programming
0 references
branch-and-bound
0 references
Lagrangian relaxation
0 references
Lagrangian dual bound
0 references
0.9105797410011292
0 references
0.8810545206069946
0 references
0.8810411095619202
0 references
0.8318255543708801
0 references
0.8194996118545532
0 references
