Tabu search and design optimization
type: Item
instance of: scholarly article
title: Tabu search and design optimization
zbMATH Open document ID: 0735.65036
DOI: 10.1016/0010-4485(91)90089-F
author: J. A. Bland
author: G. P. Dawson
published in: CAD. Computer-Aided Design
publication date: 1992-06-26T00:00:00Z
review text: Tabu search is a heuristic procedure for combinatorial optimization problems of a high degree of complexity. The paper is devoted to explain the fundamental tabu-search mechanism, to show how it may be applied to the layout design of electronic circuits, and to indicate possible future developments.
reviewed by: Florica Luban
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 94C30
zbMATH DE Number: 23368
zbMATH Keywords: tabu search
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: high degree of complexity
zbMATH Keywords: layout design of electronic circuits
MaRDI profile type: Publication
full work available at URL: 0010-4485(91)90089-f
OpenAlex ID: W2075499381
description: scientific article; zbMATH DE number 23368