Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793)

From MaRDI portal
Revision as of 23:47, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving \(k\)-cluster problems to optimality with semidefinite programming
scientific article

    Statements

    title
    Solving \(k\)-cluster problems to optimality with semidefinite programming (English)
    0 references
    author
    Jérôme Malick
    0 references
    Frédéric Roupin
    0 references
    publication date
    19 December 2012
    0 references
    zbMATH Keywords
    \(k\)-cluster
    0 references
    exact resolution
    0 references
    Lagrangian relaxation
    0 references
    branch-and-bound
    0 references
    describes a project that uses
    SDPLR
    0 references
    PENSDP
    0 references
    CSDP
    0 references
    QSDP
    0 references
    SDP_S
    0 references
    SBmethod
    0 references
    cites work
    Q3983251
    0 references
    Numerical Optimization
    0 references
    Q5442492
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C22
    0 references
    90C27
    0 references
    90C57
    0 references
    zbMATH DE Number
    6116942
    0 references
    OpenAlex ID
    W2046706749
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1925793&oldid=35313220"
    Powered by MediaWiki