QAPLIB - a quadratic assignment problem library
From MaRDI portal
Publication:1361076
DOI10.1023/A:1008293323270zbMath0884.90116OpenAlexW1503085769MaRDI QIDQ1361076
Rainer E. Burkard, Franz Rendl, Stefan E. Karisch
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
Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Boolean programming (90C09) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, Partial neighborhood local searches, gym-flp: a Python package for training reinforcement learning algorithms on facility layout problems, Sinkhorn Algorithm for Lifted Assignment Problems, The fractal geometry of fitness landscapes at the local optima level, The repeated p-dispersion problem, A multi-parent genetic algorithm for the quadratic assignment problem, Facility layout problem with QAP formulation under scenario-based uncertainty, Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization, Leveraging special-purpose hardware for local search heuristics, An extreme point algorithm for a local minimum solution to the quadratic assignment problem, A hybrid biased random key genetic algorithm for the quadratic assignment problem, SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration, Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem, A cooperative parallel tabu search algorithm for the quadratic assignment problem, Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software, Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem, Solving multi objective facility layout problem by modified simulated annealing, Speeding up IP-based algorithms for constrained quadratic 0-1 optimization, A survey for the quadratic assignment problem, A branch-and-cut algorithm for quadratic assignment problems based on linearizations, A parallel ordering problem in facilities layout, A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives, A nonmonotone GRASP, Penalty weights in QUBO formulations: permutation problems, \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance, A note on a polynomial time solvable case of the quadratic assignment problem, An efficient continuation method for quadratic assignment problems, Bounds for the quadratic assignment problem using the bundle method, A landscape-based analysis of fixed temperature and simulated annealing, Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers, New variable-length data compression scheme for solution representation of meta-heuristics, A new exact discrete linear reformulation of the quadratic assignment problem, A cutoff time strategy based on the coupon collector's problem, Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem, Minimum energy configurations on a toric lattice as a quadratic assignment problem, Locating names on vertices of a transaction network, Generating QAP instances with known optimum solution and additively decomposable cost function, Integrating combinatorial algorithms into a linear programming solver, Two-level modified simulated annealing based approach for solving facility layout problem, A parallel water flow algorithm with local search for solving the quadratic assignment problem, A Conjugate Gradient Method for Electronic Structure Calculations, Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem, A penalty-based multi-objectivization approach for single objective optimization, Global optimality conditions and optimization methods for quadratic assignment problems, Autocorrelation measures for the quadratic assignment problem, Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry, Interior point methods 25 years later, An implementation of the iterated tabu search algorithm for the quadratic assignment problem, IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM, A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique, Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study, A splitting method for orthogonality constrained problems, Quadratic Combinatorial Optimization Using Separable Underestimators, Revisiting simulated annealing: a component-based analysis, Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters, An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems, Analog computation through high-dimensional physical chaotic neuro-dynamics, Two classes of quadratic assignment problems that are solvable as linear assignment problems, Coarse-Graining Large Search Landscapes Using Massive Edge Collapse, Metaheuristic downhill simplex method in combinatorial optimization, On improving convex quadratic programming relaxation for the quadratic assignment problem, ADMM for the SDP relaxation of the QAP, QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming, Convergence of a modified algorithm of fast probabilistic modeling, Special cases of the quadratic shortest path problem, Semidefinite programming approach for the quadratic assignment problem with a sparse graph, BPPLIB: a library for bin packing and cutting stock problems, Experimental analysis of crossover and mutation operators on the quadratic assignment problem, Quantile and mean value measures of search process complexity, Selected topics on assignment problems, Probabilistic stopping rules for GRASP heuristics and extensions, Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches, A feasible method for optimization with orthogonality constraints, Effective formulation reductions for the quadratic assignment problem, The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm, A new relaxation framework for quadratic assignment problems based on matrix splitting, A hybrid metaheuristic for the quadratic assignment problem, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems, On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem, Modelling convex shape priors and matching based on the Gromov-Wasserstein distance, On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope, A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem, SDP Relaxations for Some Combinatorial Optimization Problems, Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting, Lagrangian relaxation graph matching, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, Experiments on the minimum linear arrangement problem, QAPLIB, An analysis of parameter adaptation in reactive tabu search, To lay out or not to lay out?, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases, A greedy genetic algorithm for the quadratic assignment problem, Exploiting special structure in semidefinite programming: a survey of theory and applications, Scalable Semidefinite Programming, A new linearization method for quadratic assignment problems, Optimal Mass Transport for Activities Location Problem, Linear programming insights into solvable cases of the quadratic assignment problem, A revised reformulation-linearization technique for the quadratic assignment problem, 2DPackLib: a two-dimensional cutting and packing library, Finding optimal solutions to several gray pattern instances, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
