QAPLIB-A quadratic assignment problem library
From MaRDI portal
(Redirected from Publication:807376)
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 4199950 (Why is no real title available?)
- scientific article; zbMATH DE number 4076975 (Why is no real title available?)
- A New Lower Bound for the Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Hospital Layout as a Quadratic Assignment Problem
- P-Complete Approximation Problems
- Tabu Search Applied to the Quadratic Assignment Problem
- The Backboard Wiring Problem: A Placement Algorithm
Cited in
(39)- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Copositive and semidefinite relaxations of the quadratic assignment problem
- New variable-length data compression scheme for solution representation of meta-heuristics
- Backbone analysis and algorithm design for the quadratic assignment problem
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Comparing QUBO models for quantum annealing: integer encodings for permutation problems
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- Lower bounds for the quadratic assignment problem via triangle decompositions
- 2DPackLib: a two-dimensional cutting and packing library
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- Embedding signed graphs in the line
- Ant colony optimization for solving an industrial layout problem
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Optimization of the quadratic assignment problem using an ant colony algorithm
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid
- COSEARCH: A parallel cooperative metaheuristic
- Location and layout planning. A survey
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method
- A survey for the quadratic assignment problem
- A modification of threshold accepting and its application to the quadratic assignment problem
- ADMM for the SDP relaxation of the QAP
- QAPLIB
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- Semidefinite approximations for quadratic programs over orthogonal matrices
- BPPLIB: a library for bin packing and cutting stock problems
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- Random assignment problems
- Computing the splitting preconditioner for interior point method using an incomplete factorization approach
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- Heuristics from Nature for Hard Combinatorial Optimization Problems
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- Greedy randomized adaptive search procedures
- Local minima and convergence in low-rank semidefinite programming
- Building a parallel branch and bound library
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
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 Q807376)
