Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
From MaRDI portal
(Redirected from Publication:367651)
Recommendations
- A new linearization method for quadratic assignment problems
- New linearizations of quadratic assignment problems
- Improved discrete reformulations for the quadratic assignment problem
- A new exact discrete linear reformulation of the quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
Cites work
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A new linearization method for quadratic assignment problems
- 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
- Effective formulation reductions for the quadratic assignment problem
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- Optimal and Suboptimal Algorithms for the 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
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- The quadratic assignment problem
- Three Ideas for the Quadratic Assignment Problem
Cited in
(17)- A new exact discrete linear reformulation of the quadratic assignment problem
- New linearizations of quadratic assignment problems
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- Size matters: cardinality-constrained clustering and outlier detection via conic optimization
- Improved discrete reformulations for the quadratic assignment problem
- A branch-and-cut technique to solve multiobjective integer quadratic programming problems
- scientific article; zbMATH DE number 5556512 (Why is no real title available?)
- scientific article; zbMATH DE number 4072724 (Why is no real title available?)
- A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- A new linearization method for quadratic assignment problems
- scientific article; zbMATH DE number 3885661 (Why is no real title available?)
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- Facility layout problem with QAP formulation under scenario-based uncertainty
This page was built for publication: Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367651)