Reachability cuts for the vehicle routing problem with time windows (Q2432846)

From MaRDI portal
Revision as of 21:14, 24 June 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
Reachability cuts for the vehicle routing problem with time windows
scientific article

    Statements

    title
    Reachability cuts for the vehicle routing problem with time windows (English)
    0 references
    author
    Jens Lysgaard
    0 references
    publication date
    25 October 2006
    0 references
    zbMATH Keywords
    routing
    0 references
    time windows
    0 references
    precedence constraints
    0 references
    describes a project that uses
    VRP
    0 references
    CVRPSEP
    0 references
    CVRPSP
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B80
    0 references
    90B20
    0 references
    90C35
    0 references
    zbMATH DE Number
    5067611
    0 references
    OpenAlex ID
    W2150176315
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2432846&oldid=34893691"
    Powered by MediaWiki