A dual framework for lower bounds of the quadratic assignment problem based on linearization (Q1969301): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q266058 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Eranda Çela / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QAPLIB / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s006070050040 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040588207 / rank | |||
Normal rank | |||
Latest revision as of 23:00, 19 March 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
