A projection technique for partitioning the nodes of a graph
From MaRDI portal
Publication:1904714
DOI10.1007/BF02032130zbMath0841.90120OpenAlexW2069037000MaRDI QIDQ1904714
Publication date: 7 January 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02032130
Related Items
A computational study of graph partitioning, Approximation techniques for hypergraph partitioning problems, Solving the max-cut problem using eigenvalues, A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming, On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint, Semidefinite approximations for quadratic programs over orthogonal matrices, A survey of graph laplacians, Partitioning through projections: strong SDP bounds for large graph partition problems, Spectral methods for graph bisection problems., An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem, Best ellipsoidal relaxation to solve a nonconvex problem., Semidefinite programming relaxations for the graph partitioning problem, Self-Assignment Flows for Unsupervised Data Labeling on Graphs, On Laplacian spectra of parametric families of closely connected networks with application to cooperative control, The MIN-cut and vertex separator problem, Laplace eigenvalues of graphs---a survey, A new branch and bound algorithm for cell formation problem, Semidefinite programming and combinatorial optimization, Semidefinite programming for discrete optimization and matrix completion problems, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Algorithms for minclique scheduling problems, Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem, SDP Relaxations for Some Combinatorial Optimization Problems, The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts, Spectral partitioning with multiple eigenvectors, Path optimization for graph partitioning problems, Algorithms for graph partitioning problems by means of eigenspace relaxations, An optimal tree search method for the manufacturing systems cell formation problem, Spectral bounds for graph partitioning with prescribed partition sizes, Semidefinite programming and eigenvalue bounds for the graph partition problem, Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial properties and the complexity of a max-cut approximation
- A constrained eigenvalue problem
- Least squares with a quadratic constraint
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- A continuous method for computing bounds in integer quadratic optimization problems
- Laplacian eigenvalues and the maximum cut problem
- A computational study of graph partitioning
- Solving the max-cut problem using eigenvalues
- The equipartition polytope. I: Formulations, dimension and basic facets
- Computing a Trust Region Step
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- A New Heuristic for Partitioning the Nodes of a Graph
- Computing Optimal Locally Constrained Steps
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- The Optimal Partitioning of Graphs
- Eigenvalue perturbations and nonlinear parametric optimization
- An Algorithm for Partitioning the Nodes of a Graph
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- Lower Bounds for the Partitioning of Graphs
