A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM (Q3502867)

From MaRDI portal
Revision as of 10:22, 28 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
A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM
scientific article

    Statements

    title
    A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM (English)
    0 references
    author
    Zhuo Fu
    0 references
    Mike Wright
    0 references
    Richard W. Eglese
    0 references
    publication date
    20 May 2008
    0 references
    Mathematics Subject Classification ID
    90B80
    0 references
    90C09
    0 references
    90C57
    0 references
    zbMATH DE Number
    5277012
    0 references
    zbMATH Keywords
    alternative optimal solutions
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3502867&oldid=35056652"
    Powered by MediaWiki