The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561)

From MaRDI portal
Revision as of 05:49, 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
The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
scientific article

    Statements

    title
    The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (English)
    0 references
    author
    Yongquan Li
    0 references
    Wee-Chong Oon
    0 references
    Hu Qin
    0 references
    Dejian Tu
    0 references
    Andrew E. B. Lim
    0 references
    publication date
    14 May 2012
    0 references
    zbMATH DE Number
    6035022
    0 references
    zbMATH Keywords
    traveling salesman
    0 references
    pickup and delivery
    0 references
    last-in-first-out loading
    0 references
    tree data structure
    0 references
    variable neighborhood search
    0 references
    describes a project that uses
    Concorde
    0 references
    TSPLIB
    0 references
    OpenAlex ID
    W1964847870
    0 references
    cites work
    Q3036721
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q421561&oldid=35278773"
    Powered by MediaWiki