A revised reformulation-linearization technique for the quadratic assignment problem
From MaRDI portal
Publication:2339837
DOI10.1016/J.DISOPT.2014.08.003zbMATH Open1308.90123OpenAlexW1978805957MaRDI QIDQ2339837FDOQ2339837
Federico Malucelli, Borzou Rostami
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2014.08.003
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
Quadratic programming (90C20) Mixed integer programming (90C11) Boolean programming (90C09) Discrete location and assignment (90B80)
Cites Work
- QAPLIB - a quadratic assignment problem library
- Assignment Problems and the Location of Economic Activities
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- A survey for the quadratic assignment problem
- On the quadratic assignment problem
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- Title not available (Why is that?)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- The quadratic assignment problem
- The Backboard Wiring Problem: A Placement Algorithm
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- A New Lower Bound for the Quadratic Assignment Problem
- Title not available (Why is that?)
- A new bound for the quadratic assignment problem based on convex quadratic programming
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Title not available (Why is that?)
- On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices
Cited In (11)
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Sinkhorn Algorithm for Lifted Assignment Problems
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem
- Facility layout problem with QAP formulation under scenario-based uncertainty
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
Uses Software
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)
