An implementation of the iterated tabu search algorithm for the quadratic assignment problem
From MaRDI portal
(Redirected from Publication:443828)
Recommendations
- A tabu search algorithm for the quadratic assignment problem
- Solving the quadratic assignment problem by the repeated iterated tabu search method
- Tabu Search Applied to the Quadratic Assignment Problem
- Extensions of a tabu search adaptation to the quadratic assignment problem
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
Cites work
- scientific article; zbMATH DE number 23663 (Why is no real title available?)
- scientific article; zbMATH DE number 1302195 (Why is no real title available?)
- scientific article; zbMATH DE number 714533 (Why is no real title available?)
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- scientific article; zbMATH DE number 1894381 (Why is no real title available?)
- scientific article; zbMATH DE number 761271 (Why is no real title available?)
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- A hybrid metaheuristic for the quadratic assignment problem
- A new genetic algorithm for the quadratic assignment problem
- A survey for the quadratic assignment problem
- A tabu search algorithm for the quadratic assignment problem
- Algorithms for assignment problems on an array processor
- Ant colonies for the quadratic assignment problem
- Assignment Problems and the Location of Economic Activities
- Combining simulated annealing with local search heuristics
- Comparison of iterative searches for the quadratic assignment problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Iterated local search for the quadratic assignment problem
- Optimizing simulated annealing schedules with genetic programming
- P-Complete Approximation Problems
- QAPLIB - a quadratic assignment problem library
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Record breaking optimization results using the ruin and recreate principle
- Tabu Search—Part I
- Tabu Search—Part II
- The Reactive Tabu Search
- The extended concentric tabu for the quadratic assignment problem
- Very large-scale neighborhood search for the quadratic assignment problem
Cited in
(12)- Solving the quadratic assignment problem
- A penalty-based multi-objectivization approach for single objective optimization
- A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem
- scientific article; zbMATH DE number 1296790 (Why is no real title available?)
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- Taking advantage of symmetry in some quadratic assignment problems
- Extensions of a tabu search adaptation to the quadratic assignment problem
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
- Iterated local search for the quadratic assignment problem
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
This page was built for publication: An implementation of the iterated tabu search algorithm for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q443828)
