6 citations · 7 across the 6 of their papers we have counts for
6 papers
A GPU implementation of the Simulated Annealing Heuristic for the Quadratic Assignment Problem
Gerald Paul
The quadratic assignment problem (QAP) is one of the most difficult combinatorial optimization problems. An effective heuristic for obtaining approximate solutions to the QAP is si…
An efficient implementation of the simulated annealing heuristic for the quadratic assignment problem
Gerald Paul
The quadratic assignment problem (QAP) is one of the most difficult combinatorial optimization problems. One of the most powerful and commonly used heuristics to obtain approximati…
The Random Quadratic Assignment Problem
Gerald Paul, Jia Shao, H. Eugene Stanley
Optimal assignment of classes to classrooms \cite{dickey}, design of DNA microarrays \cite{carvalho}, cross species gene analysis \cite{kolar}, creation of hospital layouts cite{el…
Comparative Performance of Tabu Search and Simulated Annealing Heuristics for the Quadratic Assignment Problem
Gerald Paul
For almost two decades the question of whether tabu search (TS) or simulated annealing (SA) performs better for the quadratic assignment problem has been unresolved. To answer this…
An Efficient Implementation of the Robust Tabu Search Heuristic for Sparse Quadratic Assignment Problems
Gerald Paul
We propose and develop an efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems. The traditional implementation of the heuristic app…
A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem
Gerald Paul
We develop a variable depth search heuristic for the quadratic assignment problem. The heuristic is based on sequential changes in assignments analogous to the Lin-Kernighan sequen…