The quadratic assignment problem. II: Refined Gilmore-Lawler algorithm (Q1883810)
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: The quadratic assignment problem. II: Refined Gilmore-Lawler algorithm |
scientific article; zbMATH DE number 2107789
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The quadratic assignment problem. II: Refined Gilmore-Lawler algorithm |
scientific article; zbMATH DE number 2107789 |
Statements
The quadratic assignment problem. II: Refined Gilmore-Lawler algorithm (English)
0 references
13 October 2004
0 references
The Gilmore-Lawler algorithm for the quadratic assignment problem is refined within the single assignment scheme by reducing the number of linear assignment problems solved and the number of subgradients computed by finite formulas at each iteration. Part I, cf. Zbl 1057.90536.
0 references
