Pages that link to "Item:Q1904714"

The following pages link to A projection technique for partitioning the nodes of a graph (Q1904714):

Displaying 31 items.

• On Laplacian spectra of parametric families of closely connected networks with application to cooperative control (Q506453) (← links)
• Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
• The MIN-cut and vertex separator problem (Q683339) (← links)
• Laplace eigenvalues of graphs---a survey (Q686298) (← links)
• A new branch and bound algorithm for cell formation problem (Q693667) (← links)
• Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
• Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
• Path optimization for graph partitioning problems (Q1276954) (← links)
• An optimal tree search method for the manufacturing systems cell formation problem (Q1291773) (← links)
• Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices (Q1321653) (← links)
• A computational study of graph partitioning (Q1340061) (← links)
• Spectral methods for graph bisection problems. (Q1406654) (← links)
• Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
• Algorithms for graph partitioning problems by means of eigenspace relaxations (Q1577115) (← links)
• The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (Q1803742) (← links)
• Approximation techniques for hypergraph partitioning problems (Q1891922) (← links)
• Solving the max-cut problem using eigenvalues (Q1900149) (← links)
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
• On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint (Q1921328) (← links)
• Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← links)
• Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
• Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
• A survey of graph laplacians (Q4853923) (← links)
• Self-Assignment Flows for Unsupervised Data Labeling on Graphs (Q5143287) (← links)
• Semidefinite programming and combinatorial optimization (Q5906394) (← links)
• Algorithms for minclique scheduling problems (Q5961609) (← links)
• Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)
• Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)