Heuristics for biquadratic assignment problems and their computational comparison
type: Item
instance of: scholarly article
title: Heuristics for biquadratic assignment problems and their computational comparison
zbMATH Open document ID: 0904.90138
DOI: 10.1016/0377-2217(95)00007-D
author: Eranda Çela
author: Rainer E. Burkard
published in: European Journal of Operational Research
publication date: 1998-06-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 1162842
zbMATH Keywords: biquadratic assignment
zbMATH Keywords: heuristics
zbMATH Keywords: simulated annealing
zbMATH Keywords: tabu search
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems
cites work: Q4321551
cites work: An improved annealing scheme for the QAP
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: A user's guide to tabu search
cites work: Using tabu search techniques for graph coloring
cites work: Optimization by Simulated Annealing
cites work: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Tabu Search Applied to the Quadratic Assignment Problem
cites work: A Monte Carlo simulated annealing approach to optimization over continuous variables
description: scientific article; zbMATH DE number 1162842