Simulated annealing and tabu search in the long run: A comparison on QAP tasks
type: Item
instance of: scholarly article
title: Simulated annealing and tabu search in the long run: A comparison on QAP tasks
zbMATH Open document ID: 0812.68067
DOI: 10.1016/0898-1221(94)00147-2
publication date: 1994-11-06T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 681868
zbMATH Keywords: simulated annealing
zbMATH Keywords: tabu search
zbMATH Keywords: quadratic assignment problem
author: Roberto Battiti
author: Giampietro Tecchiolli
MaRDI profile type: Publication
full work available at URL: 0898-1221(94)00147-2
OpenAlex ID: W1973189474
cites work: Bounding the probability of success of stochastic methods for global optimization
cites work: Optimization by Simulated Annealing
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: EPCOT: An efficient procedure for coloring optimally with Tabu Search
cites work: Q4739657
cites work: Algorithms for assignment problems on an array processor
cites work: Local search with memory: Benchmarking RTS
cites work: The Backboard Wiring Problem: A Placement Algorithm
Wikidata QID: Q127088230
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 681868