Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem (Q3342216)

From MaRDI portal
Revision as of 01:08, 4 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
scientific article

    Statements

    Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem (English)
    0 references
    0 references
    1983
    0 references
    time-constrained traveling salesman
    0 references
    time window constraints
    0 references
    disjunctive graph model
    0 references
    longest path algorithm
    0 references
    branch and bound solution procedure
    0 references
    Computational results
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references