Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming (Q4294336)

From MaRDI portal
Revision as of 01:15, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 572302
Language Label Description Also known as
English
Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
scientific article; zbMATH DE number 572302

    Statements

    Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 1994
    0 references
    state space relaxation
    0 references
    dial-a-ride
    0 references
    bounding procedure
    0 references
    traveling salesman problem with precedence constraints
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references