Pages that link to "Item:Q2815440"
From MaRDI portal
The following pages link to A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (Q2815440):
Displaying 23 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Finding optimal solutions to several gray pattern instances (Q2115324) (← links)
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
- A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Integrating combinatorial algorithms into a linear programming solver (Q2418164) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
- Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)
- An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)
