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

From MaRDI portal
Revision as of 00:43, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    OpenAlex ID
    W2153565255
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2892314&oldid=32441282"
    Powered by MediaWiki