QAPLIB – A Quadratic Assignment ProblemLibrary

Authors:
Rainer E. Burkard;Stefan E. Karisch;Franz Rendl
Affiliations:
Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-8010 Graz, Austria,;Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark;Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-8010 Graz, Austria,
Venue:
Journal of Global Optimization
Year:
1997

Citing 6
Cited 75

A new lower bound via projection for the quadratic assignment problem

Mathematics of Operations Research
Heuristic and exact algorithms for the quadratic assignment problem

Heuristic and exact algorithms for the quadratic assignment problem
Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP

ACM Transactions on Mathematical Software (TOMS)
Lower bounds for the quadratic assignment problem via triangle decompositions

Mathematical Programming: Series A and B
Solving Large Quadratic Assignment Problems in Parallel

Computational Optimization and Applications
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs

Assignment and Matching Problems: Solution Methods with FORTRAN-Programs

On the Applicability of Lower Bounds for Solving RectilinearQuadratic Assignment Problems in Parallel

Computational Optimization and Applications
Efficient Genetic Algorithms Using Simple Genes Exchange LocalSearch Policy for the Quadratic Assignment Problem

Computational Optimization and Applications
A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems

Computational Optimization and Applications
CHESS—Changing Horizon Efficient Set Search: A Simple Principle for Multiobjective Optimization

Journal of Heuristics
On the Hardness of the Quadratic Assignment Problem with Metaheuristics

Journal of Heuristics
Generating Hard Test Instances with Known Optimal Solution for the Rectilinear Quadratic Assignment Problem

Journal of Global Optimization
Extensive Testing of a Hybrid Genetic Algorithm for Solving Quadratic Assignment Problems

Computational Optimization and Applications
A Markov Chain Monte Carlo Algorithm for the Quadratic Assignment Problem Based on Replicator Equations

ICANN '01 Proceedings of the International Conference on Artificial Neural Networks
Evaluation of Convex Optimization Techniques for the Weighted Graph-Matching Problem in Computer Vision

Proceedings of the 23rd DAGM-Symposium on Pattern Recognition
Selected topics on assignment problems

Discrete Applied Mathematics
On Enforced Convergence of ACO and its Implementation on the Reconfigurable Mesh Architecture Using Size Reduction Tasks

The Journal of Supercomputing
Experiments on the minimum linear arrangement problem

Journal of Experimental Algorithmics (JEA)
A tabu search algorithm for the quadratic assignment problem

Computational Optimization and Applications
Test Problem Generator for the Multidimensional Assignment Problem

Computational Optimization and Applications
Solving large scale combinatorial optimization using PMA-SLS

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The enhanced evolutionary tabu search and its application to the quadratic assignment problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem

IEEE Intelligent Systems
2005 Special issue: A mixed analog/digital chaotic neuro-computer system for quadratic assignment problems

Neural Networks - 2005 Special issue: IJCNN 2005
A Hybrid Metaheuristic for the Quadratic Assignment Problem

Computational Optimization and Applications
Adaptation for parallel memetic algorithm based on population entropy

Proceedings of the 8th annual conference on Genetic and evolutionary computation
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
A fast hybrid genetic algorithm for the quadratic assignment problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Locality-aware connection management and rank assignment for wide-area MPI

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Hardware-oriented ant colony optimization

Journal of Systems Architecture: the EUROMICRO Journal
λ-Opt Neural Approaches to Quadratic Assignment Problems

Neural Computation
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views

Image and Vision Computing
Solution bias in ant colony optimisation: Lessons for selecting pheromone models

Computers and Operations Research
Iterated fast local search algorithm for solving quadratic assignment problems

Robotics and Computer-Integrated Manufacturing
A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem

Informatica
Solvable Performances of Optimization Neural Networks with Chaotic Noise and Stochastic Noise with Negative Autocorrelation

Neural Information Processing
A new minimum pheromone threshold strategy (MPTS) for max-min ant system

Applied Soft Computing
Testing of Hybrid Genetic Algorithms for Structured Quadratic Assignment Problems

Informatica
Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem

Journal of Global Optimization
An efficient continuation method for quadratic assignment problems

Computers and Operations Research
The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm

Computers and Operations Research
Ruin and recreate principle based approach for the quadratic assignment problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
A dynamic-programming bound for the quadratic assignment problem

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Effective formulation reductions for the quadratic assignment problem

Computers and Operations Research
Chemical-reaction-inspired metaheuristic for optimization

IEEE Transactions on Evolutionary Computation
Semidefinite approximations for quadratic programs over orthogonal matrices

Journal of Global Optimization
A hybrid evolutionary algorithm to quadratic three-dimensional assignment problem with local search for many-core graphics processors

IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
Mutual information analyses of chaotic neurodynamics driven by neuron selection methods in synchronous exponential chaotic tabu search for quadratic assignment problems

ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
Realizing ideal spatiotemporal chaotic searching dynamics for optimization algorithms using neural networks

ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
Optimal solutions for the balanced minimum evolution problem

Computers and Operations Research
Coupling simulation with heuristiclab to solve facility layout problems

Winter Simulation Conference
A cooperative tree-based hybrid GA-B&B approach for solving challenging permutation-based problems.

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Off-line and on-line tuning: a study on operator selection for a memetic algorithm applied to the QAP

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
A methodology to find the elementary landscape decomposition of combinatorial optimization problems

Evolutionary Computation
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming

SIAM Journal on Optimization
Multiobjective quadratic assignment problem solved by an explicit building block search algorithm – MOMGA-IIa

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
A cutting planes algorithm based upon a semidefinite relaxation for the quadratic assignment problem

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Radial search: a simple solution approach to hard combinatorial problems

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
A survey of approximation results for local search algorithms

Efficient Approximation and Online Algorithms
Fine-Tuning algorithm parameters using the design of experiments approach

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Pareto autonomous local search

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem

Operations Research Letters
Copositive and semidefinite relaxations of the quadratic assignment problem

Discrete Optimization
Note: A note on a polynomial time solvable case of the quadratic assignment problem

Discrete Optimization
Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems

Discrete Optimization
An exploration-exploitation compromise-based adaptive operator selection for local search

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Generic hardness estimation using fitness and parameter landscapes applied to robust taboo search and the quadratic assignment problem

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
An implementation of the iterated tabu search algorithm for the quadratic assignment problem

OR Spectrum
Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem

Information Sciences: an International Journal
ACO on multiple GPUs with CUDA for faster solution of QAPs

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Global equilibrium search algorithms for combinatorial optimization problems

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Local optima networks, landscape autocorrelation and heuristic search performance

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
A comparison of operator utility measures for on-line operator selection in local search

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem

International Journal of Swarm Intelligence Research
Modelling Convex Shape Priors and Matching Based on the Gromov-Wasserstein Distance

Journal of Mathematical Imaging and Vision
Automatic algorithm selection for the quadratic assignment problem using fitness landscape analysis

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
A comparative analysis of meta-heuristic approaches for facility layout design problem: a case study for an elevator manufacturer

Journal of Intelligent Manufacturing
Geometric-based sampling for permutation optimization

Proceedings of the 15th annual conference on Genetic and evolutionary computation
Recent advances in problem understanding: changes in the landscape a year on

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
A parallel ordering problem in facilities layout

Computers and Operations Research
A Splitting Method for Orthogonality Constrained Problems

Journal of Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A collection of electronically available data instances for the QuadraticAssignment Problem is described. For each instance, we provide detailedinformation, indicating whether or not the problem is solved to optimality. Ifnot, we supply the best known bounds for the problem. Moreover we surveyavailable software and describe recent dissertations related to the QuadraticAssignment Problem.