An efficient labeling technique for solving sparse assignment problems (Q1071650)

From MaRDI portal
Revision as of 11:55, 17 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient labeling technique for solving sparse assignment problems
scientific article

    Statements

    An efficient labeling technique for solving sparse assignment problems (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    We describe a new implementation of the shortest augmenting path approach for solving sparse assignment problems and report computational experience documenting its efficiency.
    0 references
    implementation
    0 references
    shortest augmenting path
    0 references
    sparse assignment
    0 references
    computational experience
    0 references

    Identifiers