A GRASP for the biquadratic assignment problem
From MaRDI portal
Publication:1291786
Recommendations
Cites work
- scientific article; zbMATH DE number 714530 (Why is no real title available?)
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- scientific article; zbMATH DE number 934533 (Why is no real title available?)
- A More Portable Fortran Random Number Generator
- Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
- Algorithm 769
- Greedy randomized adaptive search procedures
- Heuristics for biquadratic assignment problems and their computational comparison
- The quadratic assignment problem
Cited in
(12)- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Approximate solutions to the turbine balancing problem.
- Standard bi-quadratic optimization problems and unconstrained polynomial reformulations
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
- scientific article; zbMATH DE number 714530 (Why is no real title available?)
- A survey for the quadratic assignment problem
- A system for distance studies and applications of metaheuristics
- A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- On cones of nonnegative quartic forms
- A nonmonotone GRASP
- On new classes of nonnegative symmetric tensors
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)