Polynomially solvable personnel rostering problems (Q320874)

From MaRDI portal
Revision as of 16:58, 12 July 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
Polynomially solvable personnel rostering problems
scientific article

    Statements

    title
    Polynomially solvable personnel rostering problems (English)
    0 references
    author
    Pieter Smet
    0 references
    Peter Brucker
    0 references
    Patrick de Causmaecker
    0 references
    Greet vanden Berghe
    0 references
    publication date
    7 October 2016
    0 references
    zbMATH Keywords
    personnel rostering
    0 references
    polynomial time algorithms
    0 references
    assignment
    0 references
    networks
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B70
    0 references
    90C60
    0 references
    90B80
    0 references
    90C35
    0 references
    zbMATH DE Number
    6635753
    0 references
    OpenAlex ID
    W1639820114
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q320874&oldid=36277633"
    Powered by MediaWiki