Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem (Q852261)
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: Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem |
scientific article; zbMATH DE number 5076491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem |
scientific article; zbMATH DE number 5076491 |
Statements
Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem (English)
0 references
28 November 2006
0 references
asymptotically optimal solution
0 references
approximate algorithm
0 references
0 references
0.862835705280304
0 references
0.8562299013137817
0 references
0.8395161628723145
0 references
0.8316985368728638
0 references
0.8060616850852966
0 references
