An efficient semidefinite programming relaxation for the graph partition problem
From MaRDI portal
Recommendations
- Semidefinite programming relaxations for the graph partitioning problem
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- scientific article; zbMATH DE number 1182569
- Graph bisection revisited
- An improved rounding method and semidefinite programming relaxation for graph partition
Cites work
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- A low-dimensional semidefinite relaxation for the quadratic assignment problem
- A new approach to minimising the frontwidth in finite element calculations
- A projection technique for partitioning the nodes of a graph
- An Efficient Heuristic Procedure for Partitioning Graphs
- An improved rounding method and semidefinite programming relaxation for graph partition
- Approximate graph coloring by semidefinite programming
- Approximation algorithms for maximization problems arising in graph partitioning
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Graph partitioning and parallel computing
- Graph partitioning using linear and semidefinite programming
- scientific article; zbMATH DE number 995811 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3783337 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 1182569 (Why is no real title available?)
- scientific article; zbMATH DE number 2196287 (Why is no real title available?)
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Lower Bounds for the Partitioning of Graphs
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Matrix-Lifting Semi-Definite Programming for Detection in Multiple Antenna Systems
- Min-cut clustering
- Multiple-way network partitioning
- On equivalence of semidefinite relaxations for quadratic matrix programming
- On Lagrangian relaxation of quadratic matrix constraints
- On semidefinite programming relaxations of maximum \(k\)-section
- Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
- Relaxations of combinatorial problems via association schemes
- SDP relaxations for some combinatorial optimization problems
- Semidefinite programming relaxations for the graph partitioning problem
- Semidefinite programming relaxations for the quadratic assignment problem
- Solving Graph Bisection Problems with Semidefinite Programming
- Some simplified NP-complete graph problems
- The node capacitated graph partitioning problem: A computational study
- The partition problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(31)- Graph partitioning using linear and semidefinite programming
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- Graph bisection revisited
- A two-level graph partitioning problem arising in mobile wireless communications
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
- Projection results for the \(k\)-partition problem
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
- On semidefinite programming relaxations of maximum \(k\)-section
- Semidefinite programming relaxations for the graph partitioning problem
- SDP-based bounds for graph partition via extended ADMM
- An exact approach for the multi-constraint graph partitioning problem
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- Engineering branch-and-cut algorithms for the equicut problem
- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
- scientific article; zbMATH DE number 5957371 (Why is no real title available?)
- Contribution of copositive formulations to graph partitioning problem
- scientific article; zbMATH DE number 1182569 (Why is no real title available?)
- scientific article; zbMATH DE number 1945218 (Why is no real title available?)
- scientific article; zbMATH DE number 2086928 (Why is no real title available?)
- scientific article; zbMATH DE number 2088028 (Why is no real title available?)
- Contribution of copositive formulations to the graph partitioning problem
- The Maximum k-Colorable Subgraph Problem and Related Problems
- Graph-Based Representations in Pattern Recognition
- A Copositive Programming Approach to Graph Partitioning
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Partitioning through projections: strong SDP bounds for large graph partition problems
- Optimizing connected components graph partitioning with minimum size constraints using integer programming and spectral clustering techniques
- New bounds for the -k-cut and chromatic number of a graph
This page was built for publication: An efficient semidefinite programming relaxation for the graph partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967612)
