Pages that link to "Item:Q2339837"
From MaRDI portal
The following pages link to A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837):
Displaying 14 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem (Q510938) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design (Q2576440) (← links)
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (Q2815440) (← links)
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)
