On Semidefinite Programming Relaxations of the Traveling Salesman Problem (Q3648520)

From MaRDI portal
Revision as of 18:12, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On Semidefinite Programming Relaxations of the Traveling Salesman Problem
scientific article

    Statements

    title
    On Semidefinite Programming Relaxations of the Traveling Salesman Problem (English)
    0 references
    DOI
    10.1137/070711141
    0 references
    author
    Etienne de Klerk
    0 references
    Renata Sotirov
    0 references
    Dimitrii V. Pasechnik
    0 references
    publication date
    27 November 2009
    0 references
    zbMATH DE Number
    5639478
    0 references
    zbMATH Keywords
    semidefinite programming
    0 references
    combinational optimization
    0 references
    OpenAlex ID
    W2125297716
    0 references
    Wikidata QID
    Q56874368
    0 references
    arXiv ID
    0902.1843
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3648520&oldid=33643209"
    Powered by MediaWiki