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 12 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)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel (Q1384091) (← links)
- Lower bounds for the quadratic semi-assignment problem (Q1388830) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- Lower bounds for the quadratic assignment problem based upon a dual formulation (Q2770106) (← links)
- Exploiting hardware capabilities in interior point methods (Q2815515) (← links)
- A New Lower Bound Via Projection for the Quadratic Assignment Problem (Q4022029) (← links)
- The Use of Specially Structured Models for Obtaining Bounds in the Quadratic Assignment Problem (Q4290639) (← links)
- A Constructive Method for Improving Lower Bounds for a Class of Quadratic Assignment Problems (Q4319766) (← links)
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
