Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
From MaRDI portal
Publication:2030481
Recommendations
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Solving the quadratic assignment problem by the repeated iterated tabu search method
- A survey for the quadratic assignment problem
- Comparison of iterative searches for the quadratic assignment problem
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 3982880 (Why is no real title available?)
- scientific article; zbMATH DE number 3480380 (Why is no real title available?)
- scientific article; zbMATH DE number 1302175 (Why is no real title available?)
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 714530 (Why is no real title available?)
- scientific article; zbMATH DE number 714533 (Why is no real title available?)
- scientific article; zbMATH DE number 1975087 (Why is no real title available?)
- scientific article; zbMATH DE number 2112207 (Why is no real title available?)
- scientific article; zbMATH DE number 2201174 (Why is no real title available?)
- A GRASP for the biquadratic assignment problem
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- A memetic heuristic for the generalized quadratic assignment problem
- A new exact discrete linear reformulation of the quadratic assignment problem
- A new genetic algorithm for the quadratic assignment problem
- A new mixed integer programming model for curriculum balancing: application to a Turkish university
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- A polynomially solvable class of quadratic semi-assignment problems
- A quadratic assignment formulation of the molecular conformation problem
- A quadratic assignment problem without column constraints
- A study of the quadratic semi-assignment polytope
- A survey for the quadratic assignment problem
- Algorithm for quadratic semi-assignment problem with partition size coefficients
- Algorithm for the discrete Weber's problem with an accuracy estimate
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- An algorithm for the generalized quadratic assignment problem
- An algorithm for the multiprocessor assignment problem
- An efficient algorithm for a task allocation problem
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- Ant colonies for the quadratic assignment problem
- Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
- Assignment Problems and the Location of Economic Activities
- Best reduction of the quadratic semi-assignment problem
- Breakout local search for the quadratic assignment problem
- COSEARCH: A parallel cooperative metaheuristic
- Compounded genetic algorithms for the quadratic assignment problem
- Convex quadratic and semidefinite programming relaxations in scheduling
- GPU Computing for Parallel Local Search Metaheuristic Algorithms
- GRASP with path-relinking for the generalized quadratic assignment problem
- Heuristics for biquadratic assignment problems and their computational comparison
- Hospital Layout as a Quadratic Assignment Problem
- Incorporating workflow interference in facility layout design: the quartic assignment problem
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- Iterated local search for the quadratic assignment problem
- Lower bounds for the quadratic semi-assignment problem
- Modeling and Analysis of Congestion in the Design of Facility Layouts
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- On the quadratic assignment problem
- P-Complete Approximation Problems
- Parallel Ant Colonies for the quadratic assignment problem
- QAPLIB - a quadratic assignment problem library
- Quadratic assignment problems and \(M/G/C/C/\) state dependent network flows
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
- Schedule synchronization for public transit networks
- Selected topics on assignment problems
- Solving large quadratic assignment problems in parallel
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Tabu Search Applied to the Quadratic Assignment Problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The Backboard Wiring Problem: A Placement Algorithm
- The bipartite quadratic assignment problem and extensions
- The extended concentric tabu for the quadratic assignment problem
- The multi-story space assignment problem
- The quadratic assignment problem
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- The single-finger keyboard layout problem
- Three Ideas for the Quadratic Assignment Problem
Cited in
(4)
This page was built for publication: Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2030481)
