Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858)

From MaRDI portal
Revision as of 05:11, 12 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
Branch-and-cut algorithms for the split delivery vehicle routing problem
scientific article

    Statements

    title
    Branch-and-cut algorithms for the split delivery vehicle routing problem (English)
    0 references
    author
    F. Blanchet-Sadri
    0 references
    M. Dambrine
    0 references
    publication date
    23 June 2016
    0 references
    zbMATH Keywords
    split delivery vehicle routing problem
    0 references
    branch-and-cut
    0 references
    describes a project that uses
    VRP
    0 references
    MAXFLOW
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B06
    0 references
    90C35
    0 references
    90C57
    0 references
    zbMATH DE Number
    6597564
    0 references
    OpenAlex ID
    W2057532434
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q296858&oldid=36259241"
    Powered by MediaWiki