Semidefinite programming in combinatorial optimization (Q1365053)

From MaRDI portal
Revision as of 03:53, 25 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q98060311, #quickstatements; #temporary_batch_1719280132499)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Semidefinite programming in combinatorial optimization
scientific article

    Statements

    title
    Semidefinite programming in combinatorial optimization (English)
    0 references
    DOI
    10.1007/BF02614315
    0 references
    author
    Michel X. Goemans
    0 references
    publication date
    25 May 1998
    0 references
    zbMATH DE Number
    1053956
    0 references
    zbMATH Keywords
    coding theory
    0 references
    stable sets
    0 references
    semidefinite programming
    0 references
    Lovász theta function
    0 references
    strong valid inequalities
    0 references
    maximum cut
    0 references
    cites work
    On the cut polytope
    0 references
    Q4871763
    0 references
    Q5707657
    0 references
    Q3328583
    0 references
    Q4526964
    0 references
    Matrix Analysis
    0 references
    Q4228497
    0 references
    The sandwich theorem
    0 references
    Q3222981
    0 references
    Q5690370
    0 references
    Q3320435
    0 references
    Q3973406
    0 references
    Q4146667
    0 references
    Q4231921
    0 references
    Q4281312
    0 references
    Q4324980
    0 references
    Q3137209
    0 references
    Q4840774
    0 references
    Wikidata QID
    Q98060311
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1365053&oldid=34899632"
    Powered by MediaWiki