A Lower Bound on the Expected Cost of an Optimal Assignment (Q5287981)
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: A Lower Bound on the Expected Cost of an Optimal Assignment |
scientific article; zbMATH DE number 243320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lower Bound on the Expected Cost of an Optimal Assignment |
scientific article; zbMATH DE number 243320 |
Statements
A Lower Bound on the Expected Cost of an Optimal Assignment (English)
0 references
5 August 1993
0 references
lower bound
0 references
dual heuristic algorithm
0 references
optimal assignment
0 references
0.8741604685783386
0 references
0.8188719749450684
0 references
0.8169146180152893
0 references
