A comparison of two algorithms for the assignment problem (Q1804373)

From MaRDI portal
Revision as of 19:26, 27 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A comparison of two algorithms for the assignment problem
scientific article

    Statements

    A comparison of two algorithms for the assignment problem (English)
    0 references
    0 references
    1 April 1996
    0 references
    auction algorithm
    0 references
    parallel computing
    0 references
    shortest augmenting path
    0 references
    linear assignment problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references