A Lower Bound on the Expected Cost of an Optimal Assignment (Q5287981)

From MaRDI portal
Revision as of 01:42, 22 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 243320
Language Label Description Also known as
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
    0 references
    5 August 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lower bound
    0 references
    dual heuristic algorithm
    0 references
    optimal assignment
    0 references