A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows (Q2892314)

From MaRDI portal
Revision as of 20:33, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
scientific article

    Statements

    A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows (English)
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    0 references
    traveling salesman
    0 references
    time windows
    0 references
    simulated annealing
    0 references
    penalty methods
    0 references