The convex-hull-and-line traveling salesman problem: A solvable case (Q1332749)

From MaRDI portal
Revision as of 22:32, 18 July 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
The convex-hull-and-line traveling salesman problem: A solvable case
scientific article

    Statements

    The convex-hull-and-line traveling salesman problem: A solvable case (English)
    0 references
    0 references
    0 references
    0 references
    5 September 1994
    0 references
    shortest path
    0 references
    well-solvable case
    0 references
    polynomial time algorithm
    0 references
    Euclidean traveling salesman
    0 references

    Identifiers