A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510)
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: A branch-and-bound algorithm for the minimum cut linear arrangement problem |
scientific article; zbMATH DE number 6121558
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the minimum cut linear arrangement problem |
scientific article; zbMATH DE number 6121558 |
Statements
A branch-and-bound algorithm for the minimum cut linear arrangement problem (English)
0 references
3 January 2013
0 references
graph
0 references
cutwidth
0 references
minimum cut linear arrangement
0 references
branch-and-bound algorithm
0 references
tabu search
0 references
0.93272406
0 references
0.9300343
0 references
0.9136537
0 references
0.9051548
0 references
0.9033689
0 references
0.8999618
0 references
0.89800763
0 references
0.8975651
0 references
0.89748794
0 references
