A GRASP for the biquadratic assignment problem

DOI10.1016/S0377-2217(97)00083-0zbMath0955.90066WikidataQ126983562 ScholiaQ126983562MaRDI QIDQ1291786

L. S. Pistoulis, Mauricio G. C. Resende, Panos M. Pardalos, Thelma D. Mavridou

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicscombinatorial optimizationGRASPlocal searchnonlinear assignment problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

A unified FFT-based approach to maximum assignment problems related to transitive finite group actions ⋮ A survey for the quadratic assignment problem ⋮ A nonmonotone GRASP ⋮ A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines ⋮ Standard bi-quadratic optimization problems and unconstrained polynomial reformulations ⋮ On New Classes of Nonnegative Symmetric Tensors ⋮ Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization ⋮ A system for distance studies and applications of metaheuristics ⋮ On cones of nonnegative quartic forms ⋮ Approximate solutions to the turbine balancing problem. ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search

Uses Software

• GRASP_QAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristics for biquadratic assignment problems and their computational comparison
• Greedy randomized adaptive search procedures
• The Quadratic Assignment Problem
• A More Portable Fortran Random Number Generator
• Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
• Algorithm 769