A branch-and-cut algorithm for the preemptive swapping problem (Q2913951)

From MaRDI portal
Revision as of 18:35, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the preemptive swapping problem
scientific article

    Statements

    title
    A branch-and-cut algorithm for the preemptive swapping problem (English)
    0 references
    author
    Charles Bordenave
    0 references
    Michel Gendreau
    0 references
    Gilbert Laporte
    0 references
    published in
    Networks
    0 references
    publication date
    21 September 2012
    0 references
    zbMATH Keywords
    swapping problem
    0 references
    vehicle routing
    0 references
    branch-and-cut
    0 references
    precedence relationships
    0 references
    describes a project that uses
    CVRPSP
    0 references
    Concorde
    0 references
    CVRPSEP
    0 references

    Identifiers

    DOI
    10.1002/net.20447
    0 references
    Mathematics Subject Classification ID
    90B10
    0 references
    90C57
    0 references
    05C90
    0 references
    90B06
    0 references
    zbMATH DE Number
    6085247
    0 references
    OpenAlex ID
    W2134465458
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2913951&oldid=31352408"
    Powered by MediaWiki