A general VNS heuristic for the traveling salesman problem with time windows (Q429659)

From MaRDI portal
Revision as of 09:37, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A general VNS heuristic for the traveling salesman problem with time windows
scientific article

    Statements

    title
    A general VNS heuristic for the traveling salesman problem with time windows (English)
    0 references
    publication date
    20 June 2012
    0 references
    zbMATH Keywords
    traveling salesman
    0 references
    time windows
    0 references
    heuristics
    0 references
    variable neighborhood search
    0 references
    variable neighborhood descent
    0 references
    describes a project that uses
    PERL
    0 references
    TSPTW
    0 references
    TTTPLOTS
    0 references

    Identifiers

    zbMATH DE Number
    6048239
    0 references
    OpenAlex ID
    W2050817363
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q429659&oldid=35285413"
    Powered by MediaWiki