Algorithm 769

DOI10.1145/264029.264038zbMATH Open0888.65071OpenAlexW4236441238WikidataQ113310282 ScholiaQ113310282MaRDI QIDQ4375498FDOQ4375498

Leonidas 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/

zbMATH Keywords

combinatorial optimizationquadratic assignment problemlocal searchgreedy randomized adaptive search procedureFortran subroutinessparse instances

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cited In (9)

• The quadratic assignment problem in the context of the printed circuit board assembly process
• Algorithm 774
• Algorithm 769
• Algorithm 797
• Algorithm 815
• A nonmonotone GRASP
• A GRASP for the biquadratic assignment problem
• An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
• Approximate solutions to the turbine balancing problem.

Uses Software

• QAPLIB
• GRASP

   Recommendations

• Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP 👍 👎
• Algorithm 797 👍 👎
• Algorithm 815 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Algorithm 769

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375498)