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

From MaRDI portal
Revision as of 15:55, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The two-convex-polygons TSP: A solvable case
scientific article

    Statements

    title
    The two-convex-polygons TSP: A solvable case (English)
    0 references
    DOI
    10.1007/BF02568533
    0 references
    author
    Alfredo Daniel Garcia
    0 references
    F. Javier Tejel
    0 references
    published in
    Top
    0 references
    publication date
    21 May 1998
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    90C27
    0 references
    52B12
    0 references
    90C60
    0 references
    zbMATH DE Number
    1069650
    0 references
    zbMATH Keywords
    travelling salesman problem
    0 references
    convex polygon
    0 references
    dynamic programming
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1367695&oldid=13508014"
    Powered by MediaWiki