2 problems
- 0 votes0 replies1 view
The assignment-fixing conjecture for quadratic assignment solvers
Let a quadratic assignment problem (QAP) instance be given, and suppose that a few assignments are identified as belonging to a high-quality solution. Consider permanently fixing t…
- 0 votes0 replies0 views
Tightness conjecture for the SDP relaxation of the QAP
Let be a feasible quadratic constraint that can be added to the quadratic constraints in the QAP relaxation and that cannot be linearly represented by them. The resulting re…