An experimental study of variable depth search algorithms for the quadratic assignment problem
From MaRDI portal
Publication:4904331
DOI10.1590/S0101-74382012005000007zbMath1255.90073OpenAlexW2091198274MaRDI QIDQ4904331
Elizabeth Ferreira Gouvêa Goldbarg, Marco Cesar Goldbarg
Publication date: 28 January 2013
Published in: Pesquisa Operacional (Search for Journal in Brave)
Full work available at URL: http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382012000100010&lng=en&nrm=iso&tlng=en
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
- 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
- A survey for the quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- Effective formulation reductions for the quadratic assignment problem
- Recent advances in the solution of quadratic assignment problems
- Room allocation: a polynomial subcase of the quadratic assignment problem
- A tabu search algorithm for the quadratic assignment problem
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- Solving large quadratic assignment problems on computational grids
- The extended concentric tabu for the quadratic assignment problem
- A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs
- A cooperative parallel tabu search algorithm 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
- Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique
- Iterated local search for the quadratic assignment problem
- An efficient continuation method for quadratic assignment problems
- Solving quadratic assignment problems using convex quadratic programming relaxations
- The Quadratic Assignment Problem
- Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- P-Complete Approximation Problems
- Comparison of iterative searches for the quadratic assignment problem
- Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- A variable depth search algorithm with branching search for the generalized assignment problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Box-inequalities for quadratic assignment polytopes
This page was built for publication: An experimental study of variable depth search algorithms for the quadratic assignment problem
