On optimality of a polynomial algorithm for random linear multidimensional assignment problem (Q628662)
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: On optimality of a polynomial algorithm for random linear multidimensional assignment problem |
scientific article; zbMATH DE number 5865263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On optimality of a polynomial algorithm for random linear multidimensional assignment problem |
scientific article; zbMATH DE number 5865263 |
Statements
On optimality of a polynomial algorithm for random linear multidimensional assignment problem (English)
0 references
14 March 2011
0 references
greedy heuristic
0 references
approximability
0 references
convergence almost surely
0 references
0 references
0 references
0 references
0 references
0 references
0.8726916313171387
0 references
0.8204866647720337
0 references
0.8166412115097046
0 references
0.8164469599723816
0 references
0.8121868371963501
0 references
