Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293)

From MaRDI portal
Revision as of 06:16, 10 July 2024 by Import240710060729 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 7706523
Language Label Description Also known as
English
Partitioning through projections: strong SDP bounds for large graph partition problems
scientific article; zbMATH DE number 7706523

    Statements

    Partitioning through projections: strong SDP bounds for large graph partition problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2023
    0 references
    graph partition problems
    0 references
    semidefinite programming
    0 references
    cutting planes
    0 references
    Dykstra's projection algorithm
    0 references
    augmented Lagrangian methods
    0 references

    Identifiers