Pages that link to "Item:Q2774598"
From MaRDI portal
The following pages link to Solving quadratic assignment problems using convex quadratic programming relaxations (Q2774598):
Displaying 9 items.
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)
