scientific article; zbMATH DE number 2049005
From MaRDI portal
Publication:4452814
Recommendations
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- scientific article; zbMATH DE number 714538
- scientific article; zbMATH DE number 2049010
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
Cited in
(16)- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A trust branching path heuristic for permutation problems
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- RLT insights into lift-and-project closures
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- A survey for the quadratic assignment problem
- A parallel water flow algorithm with local search for solving the quadratic assignment problem
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- Iterated local search for the quadratic assignment problem
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- scientific article; zbMATH DE number 2049010 (Why is no real title available?)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452814)
