Pages that link to "Item:Q1925786"

The following pages link to On semidefinite programming relaxations of maximum \(k\)-section (Q1925786):

Displaying 9 items.

• Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
• The MIN-cut and vertex separator problem (Q683339) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• Graph bisection revisited (Q1657405) (← links)
• Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
• An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
• Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)