Pages that link to "Item:Q2774598"
From MaRDI portal
The following pages link to Solving quadratic assignment problems using convex quadratic programming relaxations (Q2774598):
Displayed 5 items.
- 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)
- Subgraph Matching with Semidefinite Programming (Q3438926) (← links)