On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965)

From MaRDI portal
Revision as of 17:45, 14 June 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
On the refinement of bounds of heuristic algorithms for the traveling salesman problem
scientific article

    Statements

    On the refinement of bounds of heuristic algorithms for the traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation
    0 references
    heuristics
    0 references
    traveling salesman
    0 references
    bounds
    0 references