Semidefinite programming relaxations for the graph partitioning problem (Q1961466): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lagrangian Relaxation of Quadratic Matrix Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lattice of faces of a finite dimensional cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of diagonally dominant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very fast simulated re-annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Graph Bisection Problems with Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection technique for partitioning the nodes of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank

Latest revision as of 11:13, 29 May 2024

scientific article
Language Label Description Also known as
English
Semidefinite programming relaxations for the graph partitioning problem
scientific article

    Statements

    Semidefinite programming relaxations for the graph partitioning problem (English)
    0 references
    0 references
    0 references
    21 March 2000
    0 references
    graph partitioning
    0 references
    Lagrangian relaxations
    0 references
    semidefinite programming relaxations
    0 references
    gangster operator
    0 references

    Identifiers