Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
From MaRDI portal
Publication:367651
DOI10.1007/S10479-012-1079-4zbMATH Open1273.90109OpenAlexW2083354866MaRDI QIDQ367651FDOQ367651
Huizhen Zhang, C. Beltran-Royo, Liang Ma
Publication date: 16 September 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1079-4
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
- QAPLIB - a quadratic assignment problem library
- Assignment Problems and the Location of Economic Activities
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A survey 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
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Three Ideas for the Quadratic Assignment Problem
- A new linearization method for quadratic assignment problems
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Effective formulation reductions for the quadratic assignment problem
- A new relaxation framework for quadratic assignment problems based on matrix splitting
Cited In (14)
- A new exact discrete linear reformulation of the quadratic assignment problem
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- A branch-and-cut technique to solve multiobjective integer quadratic programming problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization
- Title not available (Why is that?)
- 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
Uses Software
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)
