Exploiting sparsity for the min \(k\)-partition problem (Q2175445): Difference between revisions

From MaRDI portal
← Older editNewer edit →
ReferenceBot (talk | contribs)
Bots
1,903,984 edits
‎Changed an Item
‎Created claim: Wikidata QID (P12): Q127597281, #quickstatements; #temporary_batch_1721927112556
Property / Wikidata QID
 
Property / Wikidata QID: Q127597281 / rank
 
Normal rank

Revision as of 18:07, 25 July 2024

scientific article
Language Label Description Also known as
English
Exploiting sparsity for the min \(k\)-partition problem
scientific article

    Statements

    title
    Exploiting sparsity for the min \(k\)-partition problem (English)
    0 references
    author
    Guanglei Wang
    0 references
    Hassan Hijazi
    0 references
    publication date
    29 April 2020
    0 references
    zbMATH Keywords
    integer programming
    0 references
    graph partitioning
    0 references
    semidefinite programming
    0 references
    chordal graph
    0 references
    describes a project that uses
    Gravity
    0 references
    CPLEX
    0 references
    ComputeTW
    0 references
    Rudy
    0 references
    cites work
    On the cut polytope
    0 references
    Q5603088
    0 references
    Q4288578
    0 references
    The partition problem
    0 references
    Q3974969
    0 references
    Q4737533
    0 references
    Q3328583
    0 references
    Orbitopal fixing
    0 references
    Q2816028
    0 references
    Q4198056
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    90C10
    0 references
    90C22
    0 references
    90C35
    0 references
    zbMATH DE Number
    7194825
    0 references
    OpenAlex ID
    W2963760933
    0 references
    arXiv ID
    1709.00485
    0 references
    Wikidata QID
    Q127597281
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2175445&oldid=36680480"
    Powered by MediaWiki