Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571)

From MaRDI portal
Revision as of 03:15, 16 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
Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks
scientific article

    Statements

    Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (English)
    0 references
    11 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman
    0 references
    loading constraints
    0 references
    branch-and-cut
    0 references
    pickup and delivery
    0 references
    multiple stacks
    0 references
    0 references