An Improved Heuristic for the Quadratic Assignment Problem
From MaRDI portal
Publication:3682244
Recommendations
- A new heuristic for the quadratic assignment problem
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
Cited in
(13)- Parallel processing for difficult combinatorial optimization problems
- Strengthening Gilmore's bound for the quadratic assignment problem
- A genetic algorithm for flowshop sequencing
- A new heuristic for the quadratic assignment problem
- A heuristic method for the quadratic assignment problem
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- Heuristic methods and applications: A categorized survey
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- Multiple objective programming for the quadratic assignment problem
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
- An improved annealing scheme for the QAP
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
This page was built for publication: An Improved Heuristic for the Quadratic Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3682244)