QAPLIB-A quadratic assignment problem library
From MaRDI portal
Publication:807376
DOI10.1016/0377-2217(91)90197-4zbMath0729.90993OpenAlexW2009832821MaRDI QIDQ807376
Rainer E. Burkard, Stefan E. Karisch, Franz Rendl
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90197-4
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
Copositive and semidefinite relaxations of the quadratic assignment problem, Ant colony optimization for solving an industrial layout problem, PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID, The quadratic three-dimensional assignment problem: exact and approximate solution methods, A survey for the quadratic assignment problem, Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods, A Lagrangian relaxation algorithm for sparse quadratic assignment problems, A modification of threshold accepting and its application to the quadratic assignment problem, Optimization of the quadratic assignment problem using an ant colony algorithm, Lower bounds for the quadratic assignment problem via triangle decompositions, Location and layout planning. A survey, A level-2 reformulation-linearization technique bound for the quadratic assignment problem, New variable-length data compression scheme for solution representation of meta-heuristics, Semidefinite approximations for quadratic programs over orthogonal matrices, A parallel depth first search branch and bound algorithm for the quadratic assignment problem, A primal barrier function phase I algorithm for nonsymmetric conic optimization problems, A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP, Heuristics from Nature for Hard Combinatorial Optimization Problems, ADMM for the SDP relaxation of the QAP, An experimental study of variable depth search algorithms for the quadratic assignment problem, BPPLIB: a library for bin packing and cutting stock problems, Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method, Random assignment problems, Backbone analysis and algorithm design for the quadratic assignment problem, Embedding signed graphs in the line, A new class of preconditioners for large-scale linear systems from interior point methods for linear programming, Local minima and convergence in low-rank semidefinite programming, Optimizing a polyhedral-semidefinite relaxation of completely positive programs, A performance guarantee heuristic for electronic components placement problems including thermal effects, Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach, COSEARCH: A parallel cooperative metaheuristic, Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting, Greedy randomized adaptive search procedures, QAPLIB, One-dimensional machine location problems in a multi-product flowline with equidistant locations, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, 2DPackLib: a two-dimensional cutting and packing library
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- A New Lower Bound for the Quadratic Assignment Problem
- Tabu Search Applied to the Quadratic Assignment Problem
- P-Complete Approximation Problems
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Hospital Layout as a Quadratic Assignment Problem
