The two-convex-polygons TSP: A solvable case (Q1367695)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The two-convex-polygons TSP: A solvable case
scientific article

    Statements

    The two-convex-polygons TSP: A solvable case (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 May 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    travelling salesman problem
    0 references
    convex polygon
    0 references
    dynamic programming
    0 references