An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.1120.0542 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167345674 / 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: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning and parallel computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations of Combinatorial Problems Via Association Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite programming relaxations of maximum \(k\)-section / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to minimising the frontwidth in finite element calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming / 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: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Maximization Problems Arising in Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node capacitated graph partitioning problem: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3961697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved rounding method and semidefinite programming relaxation for graph partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph coloring by semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400639 / 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: Graph partitioning using linear and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix-Lifting Semi-Definite Programming for Detection in Multiple Antenna Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive and semidefinite relaxations of the quadratic assignment problem / 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: Multiple-way network partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDP Relaxations for Some Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank

Latest revision as of 12:43, 13 July 2024

scientific article
Language Label Description Also known as
English
An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem
scientific article

    Statements

    An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (English)
    0 references
    0 references
    1 March 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    graph partition
    0 references
    graph equipartition
    0 references
    matrix lifting
    0 references
    vector lifting
    0 references
    semidefinite programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references