A dual framework for lower bounds of the quadratic assignment problem based on linearization (Q1969301): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QAPLIB / rank | |||
Normal rank | |||
Revision as of 16:14, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dual framework for lower bounds of the quadratic assignment problem based on linearization |
scientific article |
Statements
A dual framework for lower bounds of the quadratic assignment problem based on linearization (English)
0 references
16 March 2000
0 references
Combinatorial optimization, quadratic assignment problem, lower bounds, dual approach
0 references
