GRASP_QAP

swMATH4684MaRDI QIDQ16854FDOQ16854

Author name not available (Why is that?)

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 (21)

• A greedy genetic algorithm for the quadratic assignment problem
• Metaheuristics for the integrated machine allocation and layout problem
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• 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
• Solution procedures for the dynamic facility layout problem
• Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem
• Title not available (Why is that?)
• QAPLIB
• GRASP
• SDP_S
• Algorithm 797
• Algorithm 787
• Algorithm 769
• GRASP with path-relinking for the generalized quadratic assignment problem
• An experimental study of variable depth search algorithms for the quadratic assignment problem
• 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
• A GRASP for the biquadratic assignment problem
• Solving large quadratic assignment problems on computational grids

This page was built for software: GRASP_QAP