Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints (Q4367231)

From MaRDI portal
Revision as of 00:43, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1091515
Language Label Description Also known as
English
Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
scientific article; zbMATH DE number 1091515

    Statements

    Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 1998
    0 references
    0 references
    state space relaxation
    0 references
    traveling salesman
    0 references
    time window and precedence constraints
    0 references
    Hamiltonian tour
    0 references
    bounding functions
    0 references
    0 references