Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647)

From MaRDI portal
Revision as of 18:24, 6 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
Stronger \(K\)-tree relaxations for the vehicle routing problem
scientific article

    Statements

    title
    Stronger \(K\)-tree relaxations for the vehicle routing problem (English)
    0 references
    author
    Abilio Lucena
    0 references
    Carlos A. Martinhon
    0 references
    Nelson F. Maculan
    0 references
    publication date
    6 August 2004
    0 references
    zbMATH Keywords
    Integer programming
    0 references
    Exact solution algorithm
    0 references
    Vehicle routing problem
    0 references
    Relax
    0 references
    and cut
    0 references
    describes a project that uses
    TSPLIB
    0 references
    VRP
    0 references
    cites work
    Q4221472
    0 references
    Q3688098
    0 references
    Q4845366
    0 references
    Q3751354
    0 references
    Q3677509
    0 references

    Identifiers

    zbMATH DE Number
    2083620
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1827647&oldid=34366221"
    Powered by MediaWiki