The Euclidean traveling salesman problem is NP-complete (Q1250163)

From MaRDI portal
Revision as of 13:43, 15 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
The Euclidean traveling salesman problem is NP-complete
scientific article

    Statements

    title
    The Euclidean traveling salesman problem is NP-complete (English)
    0 references
    publication date
    1977
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C35
    0 references
    05C35
    0 references
    65K05
    0 references
    68Q25
    0 references
    05C30
    0 references
    94C15
    0 references
    05B40
    0 references
    zbMATH DE Number
    3601429
    0 references
    Wikidata QID
    Q56067404
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1250163&oldid=21362901"
    Powered by MediaWiki