A study of diversification strategies for the quadratic assignment problem
type: Item
instance of: scholarly article
title: A study of diversification strategies for the quadratic assignment problem
zbMATH Open document ID: 0814.90060
DOI: 10.1016/0305-0548(94)90018-3
author: James Kelly
author: Manuel Laguna
author: Fred Glover
published in: Computers \& Operations Research
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 709975
zbMATH Keywords: diversification strategies
zbMATH Keywords: heuristic search
zbMATH Keywords: tabu search
zbMATH Keywords: genetic algorithms
zbMATH Keywords: simulated annealing
zbMATH Keywords: quadratic assignment
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: 0305-0548(94)90018-3
OpenAlex ID: W2132842198
cites work: Solving the maximum clique problem using a tabu search approach
cites work: A parallel tabu search algorithm for large traveling salesman problems
cites work: Tabu Search Applied to the Quadratic Assignment Problem
cites work: Bandwidth Packing: A Tabu Search Approach
cites work: Quadratic assignment problems
cites work: Assignment Problems and the Location of Economic Activities
cites work: P-Complete Approximation Problems
cites work: Algorithms for assignment problems on an array processor
cites work: Extensions of a tabu search adaptation to the quadratic assignment problem
cites work: Applying tabu search with influential diversification to multiprocessor scheduling
description: scientific article; zbMATH DE number 709975