A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879)

From MaRDI portal
Revision as of 03:10, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
scientific article

    Statements

    A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 June 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    generalized traveling salesman problem
    0 references
    time-windows
    0 references
    branch-and-cut
    0 references
    delivery options
    0 references
    trunk delivery
    0 references
    0 references
    0 references
    0 references
    0 references