A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs (Q1806891)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1358457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs |
scientific article; zbMATH DE number 1358457 |
Statements
A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs (English)
0 references
20 December 1999
0 references
graph partitioning
0 references
compound move
0 references
minimum cost partition
0 references
directed acyclic graph
0 references
simulated annealing
0 references
neighbourhood structure
0 references
tabu search
0 references
0 references
0 references
0.8368557691574097
0 references
0.7840282917022705
0 references
0.7692674994468689
0 references
