Complexity of the min-max and min-max regret assignment problems (Q813974)

From MaRDI portal
Revision as of 10:52, 24 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
Complexity of the min-max and min-max regret assignment problems
scientific article

    Statements

    title
    Complexity of the min-max and min-max regret assignment problems (English)
    0 references
    author
    Hassene Aissi
    0 references
    Cristina Bazgan
    0 references
    Daniel Vanderpooten
    0 references
    publication date
    2 February 2006
    0 references
    Mathematics Subject Classification ID
    90B80
    0 references
    68Q17
    0 references
    90C60
    0 references
    05C85
    0 references
    zbMATH DE Number
    5003059
    0 references
    zbMATH Keywords
    assignment problem
    0 references
    min-max
    0 references
    min-max regret
    0 references
    complexity
    0 references
    NP-hard
    0 references
    OpenAlex ID
    W2039863186
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q813974&oldid=34860558"
    Powered by MediaWiki