A GRASP for the biquadratic assignment problem

DOI10.1016/S0377-2217(97)00083-0zbMATH Open0955.90066WikidataQ126983562 ScholiaQ126983562MaRDI QIDQ1291786FDOQ1291786

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

Publication date: 22 February 2001

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

Recommendations

• scientific article; zbMATH DE number 714530
• Heuristics for biquadratic assignment problems and their computational comparison
• scientific article; zbMATH DE number 714537
• The quadratic assignment problem. Theory and algorithms

zbMATH Keywords

heuristicscombinatorial optimizationlocal searchGRASPnonlinear assignment problem

Mathematics Subject Classification ID

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

Cites Work

• Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
• Algorithm 769
• Greedy randomized adaptive search procedures
• A More Portable Fortran Random Number Generator
• The quadratic assignment problem
• Title not available (Why is that?)
• Heuristics for biquadratic assignment problems and their computational comparison
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

• A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
• Standard bi-quadratic optimization problems and unconstrained polynomial reformulations
• A system for distance studies and applications of metaheuristics
• On new classes of nonnegative symmetric tensors
• A survey for the quadratic assignment problem
• A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines
• A nonmonotone GRASP
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
• Title not available (Why is that?)
• Approximate solutions to the turbine balancing problem.
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
• On cones of nonnegative quartic forms

Uses Software

• GRASP_QAP

This page was built for publication: A GRASP for the biquadratic assignment problem

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