A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138)

From MaRDI portal
Revision as of 22:31, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Branch-and-Cut method for the Capacitated Location-Routing Problem
scientific article

    Statements

    title
    A Branch-and-Cut method for the Capacitated Location-Routing Problem (English)
    0 references
    author
    José-Manuel Belenguer
    0 references
    Enrique Benavent
    0 references
    Christian Prins
    0 references
    Caroline Prodhon
    0 references
    Roberto Wolfler Calvo
    0 references
    publication date
    31 January 2011
    0 references
    zbMATH Keywords
    Location-Routing Problem
    0 references
    Branch-and-Cut
    0 references
    vehicle routing
    0 references
    facility location
    0 references
    describes a project that uses
    CVRPSP
    0 references
    VRP
    0 references
    CVRPSEP
    0 references
    cites work
    Q4233333
    0 references
    Q4532225
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B80
    0 references
    90B06
    0 references
    90C57
    0 references
    zbMATH DE Number
    5843105
    0 references
    OpenAlex ID
    W2055539533
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q622138&oldid=38415544"
    Powered by MediaWiki