QAPLIB - a quadratic assignment problem library

DOI10.1023/A:1008293323270zbMATH Open0884.90116OpenAlexW1503085769MaRDI QIDQ1361076FDOQ1361076

Authors: Rainer E. Burkard, Stefan E. Karisch, Franz Rendl 

Publication date: 23 July 1997

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008293323270

Recommendations

• scientific article; zbMATH DE number 1302195
• Recent advances in the solution of quadratic assignment problems
• scientific article; zbMATH DE number 714526
• The quadratic assignment problem. Theory and algorithms

zbMATH Keywords

softwarequadratic assignment problemproblem library

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Boolean programming (90C09) Discrete location and assignment (90B80)

Cited In (only showing first 100 items - show all)

• Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization
• A cooperative parallel tabu search algorithm for the quadratic assignment problem
• A new exact discrete linear reformulation of the quadratic assignment problem
• Interior point methods 25 years later
• A Conjugate Gradient Method for Electronic Structure Calculations
• Integrating combinatorial algorithms into a linear programming solver
• A greedy genetic algorithm for the quadratic assignment problem
• Two classes of quadratic assignment problems that are solvable as linear assignment problems
• Selected topics on assignment problems
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• A hybrid biased random key genetic algorithm for the quadratic assignment problem
• An efficient continuation method for quadratic assignment problems
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• Solving multi objective facility layout problem by modified simulated annealing
• Exploiting special structure in semidefinite programming: a survey of theory and applications
• Global optimality conditions and optimization methods for quadratic assignment problems
• The fractal geometry of fitness landscapes at the local optima level
• Autocorrelation measures for the quadratic assignment problem
• A note on a polynomial time solvable case of the quadratic assignment problem
• Quantile and mean value measures of search process complexity
• Evolutionary Computation in Combinatorial Optimization
• Linear programming insights into solvable cases of the quadratic assignment problem
• 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
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
• Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
• A splitting method for orthogonality constrained problems
• An implementation of the iterated tabu search algorithm for the quadratic assignment problem
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
• A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives
• A new linearization method for quadratic assignment problems
• Generating QAP instances with known optimum solution and additively decomposable cost function
• Bounds for the quadratic assignment problem using the bundle method
• SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
• \(L_p\)-norm regularization algorithms for optimization over permutation matrices
• QAPLIB
• An extreme point algorithm for a local minimum solution to the quadratic assignment problem
• A feasible method for optimization with orthogonality constraints
• A parallel ordering problem in facilities layout
• Modelling convex shape priors and matching based on the Gromov-Wasserstein distance
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
• Experiments on the minimum linear arrangement problem
• To lay out or not to lay out?
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
• A nonmonotone GRASP
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
• On improving convex quadratic programming relaxation for the quadratic assignment problem
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
• A hybrid metaheuristic for the quadratic assignment problem
• Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
• Analog computation through high-dimensional physical chaotic neuro-dynamics
• Experimental analysis of crossover and mutation operators on the quadratic assignment problem
• SDP Relaxations for Some Combinatorial Optimization Problems
• ADMM for the SDP relaxation of the QAP
• QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
• BPPLIB: a library for bin packing and cutting stock problems
• Convergence of a modified algorithm of fast probabilistic modeling
• Special cases of the quadratic shortest path problem
• A new relaxation framework for quadratic assignment problems based on matrix splitting
• Effective formulation reductions for the quadratic assignment problem
• Metaheuristic downhill simplex method in combinatorial optimization
• A revised reformulation-linearization technique for the quadratic assignment problem
• The repeated p-dispersion problem
• An analysis of parameter adaptation in reactive tabu search
• An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems
• 2DPackLib: a two-dimensional cutting and packing library
• Finding optimal solutions to several gray pattern instances
• Optimal Mass Transport for Activities Location Problem
• A penalty-based multi-objectivization approach for single objective optimization
• Different formulations of the gray pattern problem and their optimal solutions
• Semidefinite programming approach for the quadratic assignment problem with a sparse graph
• Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
• Leveraging special-purpose hardware for local search heuristics
• Revisiting simulated annealing: a component-based analysis
• Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
• Lagrangian relaxation graph matching
• A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
• Scalable Semidefinite Programming
• Coarse-Graining Large Search Landscapes Using Massive Edge Collapse
• Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
• IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM
• \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance
• Penalty weights in QUBO formulations: permutation problems
• Partial neighborhood local searches
• PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
• YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming
• Sinkhorn Algorithm for Lifted Assignment Problems
• Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems
• New variable-length data compression scheme for solution representation of meta-heuristics
• Where the really hard quadratic assignment problems are: the QAP-SAT instances
• On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
• A landscape-based analysis of fixed temperature and simulated annealing
• Minimum energy configurations on a toric lattice as a quadratic assignment problem
• A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases
• Inductive linearization for binary quadratic programs with linear constraints: a computational study
• Locating names on vertices of a transaction network

This page was built for publication: QAPLIB - a quadratic assignment problem library

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361076)