A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:11, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the minimum cut linear arrangement problem |
scientific article |
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
