A simulated annealing and hill-climbing algorithm for the traveling tournament problem (Q2503219)

From MaRDI portal
Revision as of 11:04, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A simulated annealing and hill-climbing algorithm for the traveling tournament problem
scientific article

    Statements

    A simulated annealing and hill-climbing algorithm for the traveling tournament problem (English)
    0 references
    0 references
    14 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    tournament
    0 references
    scheduling
    0 references
    heuristics
    0 references