Pages that link to "Item:Q2967612"

The following pages link to An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612):

Displaying 13 items.

• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• Graph bisection revisited (Q1657405) (← links)
• A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
• Projection results for the \(k\)-partition problem (Q1751250) (← 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)
• Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
• A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
• Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← 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)
• Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)