An experimental study of variable depth search algorithms for the quadratic assignment problem
From MaRDI portal
(Redirected from Publication:4904331)
Recommendations
- Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems
- A heuristic method for the quadratic assignment problem
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
Cites work
- scientific article; zbMATH DE number 1187168 (Why is no real title available?)
- scientific article; zbMATH DE number 1302195 (Why is no real title available?)
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- A survey for the quadratic assignment problem
- A tabu search algorithm for the quadratic assignment problem
- A variable depth search algorithm with branching search for the generalized assignment problem
- A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs
- Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- An efficient continuation method for quadratic assignment problems
- Assignment Problems and the Location of Economic Activities
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Box-inequalities for quadratic assignment polytopes
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
- Comparison of iterative searches for the quadratic assignment problem
- Effective formulation reductions for the quadratic assignment problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Few statistical tests for proportions comparison
- Free poset on permutations by scalar products
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Iterated local search for the quadratic assignment problem
- 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
- Recent advances in the solution of quadratic assignment problems
- Room allocation: a polynomial subcase of the quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- Solving quadratic assignment problems using convex quadratic programming relaxations
- The extended concentric tabu for the quadratic assignment problem
- The quadratic assignment problem
- Very large-scale neighborhood search for the quadratic assignment problem
- Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique
Cited in
(2)
This page was built for publication: An experimental study of variable depth search algorithms for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904331)
