Pages that link to "Item:Q2706327"

The following pages link to Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem (Q2706327):

Displaying 3 items.

• Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)