Pages that link to "Item:Q1961466"

The following pages link to Semidefinite programming relaxations for the graph partitioning problem (Q1961466):

Displaying 26 items.

• Facial reduction algorithms for conic optimization problems (Q368590) (← links)
• Robust optimization of graph partitioning involving interval uncertainty (Q443713) (← links)
• Gangster operators and invincibility of positive semidefinite matrices (Q603139) (← links)
• Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
• The MIN-cut and vertex separator problem (Q683339) (← links)
• Sums of random symmetric matrices and quadratic optimization under orthogonality constraints (Q868470) (← links)
• On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
• Graph bisection revisited (Q1657405) (← links)
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
• A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
• On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem (Q2028477) (← links)
• An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
• Congress seat allocation using mathematical optimization (Q2334468) (← links)
• Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
• Lower bounds for the bandwidth problem (Q2669517) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials (Q2830761) (← links)
• Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations (Q2940065) (← links)
• An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
• The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
• Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
• A note on the SDP relaxation of the minimum cut problem (Q6064052) (← links)
• Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)