Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP

DOI10.1145/225545.225553zbMath0884.65052OpenAlexW2089362700WikidataQ111900775 ScholiaQ111900775MaRDI QIDQ4371089

Yong Li, Mauricio G. C. Resende, Panos M. Pardalos

Publication date: 2 April 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/1996-22/

zbMATH Keywords

performanceinteger programmingcomputational experimentscombinatorial algorithmsFortran subroutinesgreedy, randomized, adaptive search procedureNP-complete quadratic assignment problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Discrete location and assignment (90B80) Packaged methods for numerical algorithms (65Y15) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (11)

The quadratic assignment problem in the context of the printed circuit board assembly process ⋮ A survey for the quadratic assignment problem ⋮ Solution methods for the balancing of jet turbines ⋮ Metaheuristics: A bibliography ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms ⋮ Greedy randomized adaptive search procedures ⋮ GRASP ⋮ GRASP_QAP ⋮ A greedy genetic algorithm for the quadratic assignment problem ⋮ A GRASP for the biquadratic assignment problem

Uses Software

• QAPLIB

This page was built for publication: Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP