Algorithm 769
From MaRDI portal
Publication:4375498
DOI10.1145/264029.264038zbMath0888.65071OpenAlexW4236441238WikidataQ113310282 ScholiaQ113310282MaRDI QIDQ4375498
Leonidas S. Pitsoulis, Panos M. Pardalos, Mauricio G. C. Resende
Publication date: 8 February 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1997-23/
combinatorial optimizationlocal searchquadratic assignment problemgreedy randomized adaptive search procedureFortran subroutinessparse instances
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
The quadratic assignment problem in the context of the printed circuit board assembly process, A nonmonotone GRASP, An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems, Approximate solutions to the turbine balancing problem., Algorithm 769, A GRASP for the biquadratic assignment problem
Uses Software
