Complexity of the unconstrained traveling tournament problem (Q1755839)

From MaRDI portal
Revision as of 05:34, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1755839&oldid=26465437"
    Powered by MediaWiki