TSP heuristics: domination analysis and complexity (Q1566378)

From MaRDI portal
Revision as of 20:47, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
TSP heuristics: domination analysis and complexity
scientific article

    Statements

    title
    TSP heuristics: domination analysis and complexity (English)
    0 references
    published in
    Algorithmica
    0 references
    publication date
    2 June 2003
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    90C59
    0 references
    90C60
    0 references
    90C27
    0 references
    zbMATH DE Number
    1922433
    0 references
    zbMATH Keywords
    Domination analysis
    0 references
    Approximation algorithms
    0 references
    Traveling salesman problem
    0 references
    Computational complexity
    0 references
    author
    Abraham P. Punnen
    0 references
    Margot, François
    0 references
    Santosh N. Kabadi
    0 references
    OpenAlex ID
    W1601856531
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1566378&oldid=31610685"
    Powered by MediaWiki