Pages that link to "Item:Q834180"

The following pages link to Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180):

Displaying 2 items.

• Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
• Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)