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

From MaRDI portal
Revision as of 14:22, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an 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

    title
    A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows (English)
    0 references
    author
    Jeffrey W. Ohlmann
    0 references
    Barrett W. Thomas
    0 references
    publication date
    18 June 2012
    0 references
    zbMATH DE Number
    6047431
    0 references
    zbMATH Keywords
    traveling salesman
    0 references
    time windows
    0 references
    simulated annealing
    0 references
    penalty methods
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2892314&oldid=23269536"
    Powered by MediaWiki