A revised reformulation-linearization technique for the quadratic assignment problem
From MaRDI portal
Publication:2339837
Recommendations
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- scientific article; zbMATH DE number 1302175
- A new linearization method for quadratic assignment problems
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
Cites work
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 714531 (Why is no real title available?)
- scientific article; zbMATH DE number 1795730 (Why is no real title available?)
- A New Lower Bound for the Quadratic Assignment Problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- A new bound for the quadratic assignment problem based on convex quadratic programming
- A survey for the quadratic assignment problem
- Assignment Problems and the Location of Economic Activities
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices
- On the quadratic assignment problem
- QAPLIB - a quadratic assignment problem library
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- The Backboard Wiring Problem: A Placement Algorithm
- The quadratic assignment problem
Cited in
(15)- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem
- Facility layout problem with QAP formulation under scenario-based uncertainty
- Sinkhorn Algorithm for Lifted Assignment Problems
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
This page was built for publication: A revised reformulation-linearization technique for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339837)
