A new exact discrete linear reformulation of the quadratic assignment problem
From MaRDI portal
Recommendations
- Improved discrete reformulations for the quadratic assignment problem
- New linearizations of quadratic assignment problems
- A new linearization method for quadratic assignment problems
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
Cites work
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A new bound for the quadratic assignment problem based on convex quadratic programming
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- A survey for the quadratic assignment problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Assignment Problems and the Location of Economic Activities
- Branching rules revisited
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Finding a cluster of points and the grey pattern quadratic assignment problem
- QAPLIB - a quadratic assignment problem library
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Recent advances in the solution of quadratic assignment problems
- Solving large quadratic assignment problems on computational grids
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
Cited in
(19)- A new form of the quadratic assignment problem and approximate solutions
- New linearizations of quadratic assignment problems
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Linear programming insights into solvable cases of the quadratic assignment problem
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- New variable-length data compression scheme for solution representation of meta-heuristics
- A new linearization method for quadratic assignment problems
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Improved discrete reformulations for the quadratic assignment problem
- Exact algorithms for the solution of the grey pattern quadratic assignment problem
- A new solution method by linearization for a special kind of quadratic assignment problem
- Facility layout problem with QAP formulation under scenario-based uncertainty
- Taking advantage of symmetry in some quadratic assignment problems
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- Effective formulation reductions for the quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
This page was built for publication: A new exact discrete linear reformulation of the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926740)
