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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153565255 / rank
 
Normal rank

Latest revision as of 00:43, 20 March 2024

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
    0 references