Complexity of the unconstrained traveling tournament problem (Q1755839)

From MaRDI portal
Revision as of 08:32, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of the unconstrained traveling tournament problem
scientific article

    Statements

    title
    Complexity of the unconstrained traveling tournament problem (English)
    0 references
    publication date
    11 January 2019
    0 references
    zbMATH Keywords
    scheduling
    0 references
    traveling tournament problem
    0 references
    NP-hard
    0 references

    Identifiers

    zbMATH DE Number
    7000220
    0 references
    OpenAlex ID
    W2482644989
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1755839&oldid=38730742"
    Powered by MediaWiki