GRASP_QAP

MaRDI QIDQ16854swMATHFDO

Official website http://dl.acm.org/citation.cfm?id=225545.225553

Described by source

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

Cited in

(22)

• Metaheuristics for the integrated machine allocation and layout problem
• A GRASP for the biquadratic assignment problem
• QAPLIB
• Solution methods for the balancing of jet turbines
• ZRAM
• Solution procedures for the dynamic facility layout problem
• GRASP
• A greedy genetic algorithm for the quadratic assignment problem
• Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem
• Solving large quadratic assignment problems on computational grids
• SDP_S
• Algorithm 797
• Algorithm 787
• Algorithm 769
• Very large-scale neighborhood search for the quadratic assignment problem
• Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
• scientific article; zbMATH DE number 1304348 (Why is no real title available?)
• 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
• GRASP with path-relinking for the generalized quadratic assignment problem
• The quadratic assignment problem in the context of the printed circuit board assembly process
• A survey for the quadratic assignment problem

This page was built for software: GRASP_QAP