A new exact discrete linear reformulation of the quadratic assignment problem
DOI10.1016/j.ejor.2012.02.010zbMath1253.90140OpenAlexW1969909704MaRDI QIDQ1926740
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.02.010
global optimizationcombinatorial optimizationquadratic assignment problemmixed integer programmingdiscrete linear reformulation
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (9)
Uses Software
Cites Work
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- A survey for the quadratic assignment problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- An algorithm for the quadratic assignment problem using Benders' decomposition
- QAPLIB - a quadratic assignment problem library
- Recent advances in the solution of quadratic assignment problems
- Solving large quadratic assignment problems on computational grids
- Branching rules revisited
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Assignment Problems and the Location of Economic Activities
- A new bound for the quadratic assignment problem based on convex quadratic programming
This page was built for publication: A new exact discrete linear reformulation of the quadratic assignment problem