Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
From MaRDI portal
Publication:817180
DOI10.1007/s10479-005-3444-zzbMath1091.90033OpenAlexW2015206516MaRDI QIDQ817180
Peter M. Hahn, Éric D. Taillard, Zvi Drezner
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://arodes.hes-so.ch/record/8160
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Search theory (90B40) Discrete location and assignment (90B80)
Related Items
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization, A hybrid biased random key genetic algorithm for the quadratic assignment problem, A cooperative parallel tabu search algorithm for the quadratic assignment problem, A survey for the quadratic assignment problem, A nonmonotone GRASP, Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers, On the unboundedness of facility layout problems, Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints, New variable-length data compression scheme for solution representation of meta-heuristics, A new exact discrete linear reformulation of the quadratic assignment problem, The multi-story space assignment problem, Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches, Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem, Generating QAP instances with known optimum solution and additively decomposable cost function, A New Neighborhood for the QAP, An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems, Estimating the number of basins of attraction of multi-objective combinatorial problems, An implementation of the iterated tabu search algorithm for the quadratic assignment problem, Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study, Exact algorithms for the solution of the grey pattern quadratic assignment problem, An experimental study of variable depth search algorithms for the quadratic assignment problem, Experimental analysis of crossover and mutation operators on the quadratic assignment problem, Embedding signed graphs in the line, New linearizations of quadratic assignment problems, Measuring instance difficulty for combinatorial optimization problems, Variable neighbourhood search: methods and applications, Iterated local search for the quadratic assignment problem, A proximal DC approach for quadratic assignment problem, Finding a cluster of points and the grey pattern quadratic assignment problem, On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem, An algorithm for the generalized quadratic assignment problem, The single-finger keyboard layout problem, Variable neighbourhood search: Methods and applications, Finding optimal solutions to several gray pattern instances
Uses Software
Cites Work
- An improved annealing scheme for the QAP
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks
- A genetic approach to the quadratic assignment problem
- QAPLIB - a quadratic assignment problem library
- Solving large quadratic assignment problems in parallel
- Variable neighborhood search
- A new heuristic for the quadratic assignment problem
- A greedy genetic algorithm for the quadratic assignment problem
- A tabu search algorithm for the quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- Compounded genetic algorithms for the quadratic assignment problem
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
- Solving quadratic assignment problems using convex quadratic programming relaxations
- A New Genetic Algorithm for the Quadratic Assignment Problem
- Ant colonies for the quadratic assignment problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Tabu Search Applied to the Quadratic Assignment Problem
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- P-Complete Approximation Problems
- Hospital Layout as a Quadratic Assignment Problem
- Numerical investigations on quadratic assignment problems
- Comparison of iterative searches for the quadratic assignment problem
- The Reactive Tabu Search
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Variable neighborhood search: Principles and applications
- On the landscape ruggedness of the quadratic assignment problem
- Adaptive memory programming: a unified view of metaheuristics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
