Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
From MaRDI portal
Recommendations
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- An exact algorithm for the general quadratic assignment problem
- A new exact algorithm for the solution of quadratic assignment problems
- scientific article; zbMATH DE number 1508175
- Dynamic programming for the quadratic assignment problem on trees
- A new form of the quadratic assignment problem and approximate solutions
- scientific article; zbMATH DE number 2049005
- scientific article; zbMATH DE number 714537
- The quadratic assignment problem. Theory and algorithms
Cited in
(30)- A multi-objective ant colony system algorithm for virtual machine placement in cloud computing
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- A new exact algorithm for the solution of quadratic assignment problems
- Diversification strategies in local search for a nonbifurcated network loading problem
- Solution bias in ant colony optimisation: Lessons for selecting pheromone models
- An Improved Heuristic for the Quadratic Assignment Problem
- scientific article; zbMATH DE number 2049010 (Why is no real title available?)
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
- Ant colonies for the quadratic assignment problem
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Evolutionary computational technique in automatic generation control of multi-area power systems with nonlinearity and energy storage unit
- Emergency relief routing models for injured victims considering equity and priority
- Contemporary approaches in matheuristics an updated survey
- An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP)
- scientific article; zbMATH DE number 1894381 (Why is no real title available?)
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
- Hybridizations of metaheuristics with branch \& bound derivates
- Ant colony optimization theory: a survey
- Variable neighborhood search for the workload balancing problem in service enterprises
- ACS-TS: Train scheduling using ant colony system
- Hybridizing exact methods and metaheuristics: a taxonomy
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- scientific article; zbMATH DE number 2049005 (Why is no real title available?)
- Iterated local search for the quadratic assignment problem
- scientific article; zbMATH DE number 2242691 (Why is no real title available?)
- Hybrid metaheuristics: an introduction
- An ant colony optimization approach for binary knapsack problem under fuzziness
- Ant colony optimization for solving an industrial layout problem
This page was built for publication: Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427381)
