On the quality of local search for the quadratic assignment problem (Q1383366)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1139430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the quality of local search for the quadratic assignment problem |
scientific article; zbMATH DE number 1139430 |
Statements
On the quality of local search for the quadratic assignment problem (English)
0 references
2 June 1998
0 references
maximum independent set
0 references
local search
0 references
NP-complete combinatorial optimization
0 references
traveling salesman
0 references
graph bipartitioning
0 references
0 references
0.8107126355171204
0 references
0.8064171671867371
0 references
