Semidefinite programming relaxations for the graph partitioning problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 995811 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- A computational study of graph partitioning
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A projection technique for partitioning the nodes of a graph
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- An Efficient Heuristic Procedure for Partitioning Graphs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Cones of diagonally dominant matrices
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Lower Bounds for the Partitioning of Graphs
- On Lagrangian relaxation of quadratic matrix constraints
- Semidefinite programming relaxations for the quadratic assignment problem
- Solving Graph Bisection Problems with Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- The lattice of faces of a finite dimensional cone
- Very fast simulated re-annealing
Cited in
(48)- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
- A note on lack of strong duality for quadratic problems with orthogonal constraints
- SDP-based bounds for graph partition via extended ADMM
- scientific article; zbMATH DE number 1560335 (Why is no real title available?)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Efficient use of semidefinite programming for selection of rotamers in protein conformations
- SDP relaxations for some combinatorial optimization problems
- A note on the SDP relaxation of the minimum cut problem
- Lower bounds for the bandwidth problem
- Relajacion lagrangeana para el problema de particionamiento de áreas geográficas
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
- Preprocessing and regularization for degenerate semidefinite programs
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- Graph bisection revisited
- scientific article; zbMATH DE number 4029297 (Why is no real title available?)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- The Maximum k-Colorable Subgraph Problem and Related Problems
- Facial reduction algorithms for conic optimization problems
- Graph partitioning using linear and semidefinite programming
- The MIN-cut and vertex separator problem
- Contribution of copositive formulations to the graph partitioning problem
- Gangster operators and invincibility of positive semidefinite matrices
- An exact approach for the multi-constraint graph partitioning problem
- Semidefinite approximations for quadratic programs over orthogonal matrices
- scientific article; zbMATH DE number 5957371 (Why is no real title available?)
- Validating numerical semidefinite programming solvers for polynomial invariants
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
- Robust optimization of graph partitioning involving interval uncertainty
- A complementary column generation approach for the graph equipartition problem
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- On the Slater condition for the SDP relaxations of nonconvex sets
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- On semidefinite programming relaxations of maximum \(k\)-section
- scientific article; zbMATH DE number 2088028 (Why is no real title available?)
- scientific article; zbMATH DE number 1953337 (Why is no real title available?)
- Congress seat allocation using mathematical optimization
- Graph-Based Representations in Pattern Recognition
- Stochastic graph partitioning: quadratic versus SOCP formulations
- scientific article; zbMATH DE number 2086928 (Why is no real title available?)
- An efficient semidefinite programming relaxation for the graph partition problem
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Graph Partitioning and Continuous Quadratic Programming
- Strong duality and minimal representations for cone optimization
- Solving graph equipartition SDPs on an algebraic variety
- New formulations for the conflict resolution problem in the scheduling of television commercials
- Partitioning through projections: strong SDP bounds for large graph partition problems
This page was built for publication: Semidefinite programming relaxations for the graph partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961466)
