Pages that link to "Item:Q1914071"
From MaRDI portal
The following pages link to Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071):
Displaying 5 items.
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- Exploiting hardware capabilities in interior point methods (Q2815515) (← links)
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
