The traveling salesman problem. Approximate algorithms (Q917453)

From MaRDI portal
Revision as of 01:36, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The traveling salesman problem. Approximate algorithms
scientific article

    Statements

    title
    The traveling salesman problem. Approximate algorithms (English)
    0 references
    author
    I. I. Melamed
    0 references
    S. I. Sergeev
    0 references
    I. Kh. Sigal
    0 references
    publication date
    1989
    0 references
    zbMATH Keywords
    efficiency of heuristic algorithms
    0 references
    traveling salesman
    0 references
    worst-case behavior
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C35
    0 references
    90-08
    0 references
    65K05
    0 references
    90C10
    0 references
    90C06
    0 references
    90C60
    0 references
    zbMATH DE Number
    4156230
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q917453&oldid=25869374"
    Powered by MediaWiki