A heuristic method for the quadratic assignment problem
From MaRDI portal
(Redirected from Publication:1429397)
Recommendations
- A new heuristic for the quadratic assignment problem
- An Improved Heuristic for the Quadratic Assignment Problem
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- scientific article; zbMATH DE number 1996465
- scientific article; zbMATH DE number 232498
- A parallel heuristic for quadratic assignment problems
- An Algorithm for the Quadratic Assignment Problem
- An algorithm for quadratic assignment problems
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
Cited in
(13)- A new heuristic for the quadratic assignment problem
- An evolutionary heuristic algorithm for the assignment problem
- scientific article; zbMATH DE number 1508175 (Why is no real title available?)
- scientific article; zbMATH DE number 1843033 (Why is no real title available?)
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- A survey of meta-heuristic solution methods for the quadratic assignment problem
- Adaptive multi-operator metaheuristics for quadratic assignment problems
- Experimental results on quadratic assignment problem.
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- Chaotic multi-start method using the affine scaling method for the quadratic assignment problem
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem
- A hybrid metaheuristic for the quadratic assignment problem
This page was built for publication: A heuristic method for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1429397)
