Comparison of iterative searches for the quadratic assignment problem
From MaRDI portal
Recommendations
Cited in
(70)- Location and layout planning. A survey
- Genetic local search with distance preserving recombination operator for a vehicle routing problem.
- A novel chaotic search for quadratic assignment problems
- Revisiting simulated annealing: a component-based analysis
- New linearizations of quadratic assignment problems
- Measuring instance difficulty for combinatorial optimization problems
- A tabu search algorithm for the quadratic assignment problem
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
- The extended concentric tabu for the quadratic assignment problem
- Metaheuristics: A bibliography
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Finding optimal solutions to several gray pattern instances
- A landscape-based analysis of fixed temperature and simulated annealing
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- A multi-parent genetic algorithm for the quadratic assignment problem
- A parallel water flow algorithm with local search for solving the quadratic assignment problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Distance preserving recombination operator for Earth observation satellites operations scheduling
- Compounded genetic algorithms for the quadratic assignment problem
- Iterated local search for the quadratic assignment problem
- A hybrid metaheuristic for the quadratic assignment problem
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- Minimum energy configurations on a toric lattice as a quadratic assignment problem
- Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems
- A multi-alternative approach to control in open systems: origins, current state, and future prospects
- L_p-norm regularization algorithms for optimization over permutation matrices
- Application of adaptive neuro fuzzy inference system in the process of transportation support
- An efficient and practically robust hybrid metaheuristic algorithm for solving fuzzy bus terminal location problems
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- Two effective hybrid metaheuristic algorithms for minimization of multimodal functions
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
- A New Neighborhood for the QAP
- Tabu Search Applied to the Quadratic Assignment Problem
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- scientific article; zbMATH DE number 1508175 (Why is no real title available?)
- scientific article; zbMATH DE number 1532439 (Why is no real title available?)
- A complex-networks view of hard combinatorial search spaces
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- Exact algorithms for the solution of the grey pattern quadratic assignment problem
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- Facility layout problem with QAP formulation under scenario-based uncertainty
- Taking advantage of symmetry in some quadratic assignment problems
- On the landscape ruggedness of the quadratic assignment problem
- Adaptive memory programming: a unified view of metaheuristics
- Genetic local search for multi-objective combinatorial optimization
- An efficient heuristic for the \(k\)-partitioning problem
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
- The repeated p-dispersion problem
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
- Different formulations of the gray pattern problem and their optimal solutions
- Where the really hard quadratic assignment problems are: the QAP-SAT instances
- Solving the quadratic assignment problem by the repeated iterated tabu search method
- Enhanced migrating birds optimization algorithm for optimization problems in different domains
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
- Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method
- Confidence in heuristic solutions?
- 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
- Generating QAP instances with known optimum solution and additively decomposable cost function
- Random assignment problems
- Heuristic algorithms for Hadamard matrices with two circulant cores
- Mapping the convergence of genetic algorithms
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- A new relaxation framework for quadratic assignment problems based on matrix splitting
This page was built for publication: Comparison of iterative searches for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229645)
