The following pages link to (Q4550779):
Displaying 12 items.
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
- A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem (Q2815440) (← links)
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
- Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
- Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
