Tabu search and design optimization (Q1178263)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tabu search and design optimization |
scientific article; zbMATH DE number 23368
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tabu search and design optimization |
scientific article; zbMATH DE number 23368 |
Statements
Tabu search and design optimization (English)
0 references
26 June 1992
0 references
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.
0 references
tabu search
0 references
combinatorial optimization
0 references
high degree of complexity
0 references
layout design of electronic circuits
0 references
