A branch-and-bound algorithm for the acyclic partitioning problem (Q336782)
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 acyclic partitioning problem |
scientific article; zbMATH DE number 6650572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for the acyclic partitioning problem |
scientific article; zbMATH DE number 6650572 |
Statements
A branch-and-bound algorithm for the acyclic partitioning problem (English)
0 references
10 November 2016
0 references
graph partitioning
0 references
branch-and-bound
0 references
constraint propagation
0 references
acyclic graph
0 references
container transshipment
0 references
0 references
0 references
0.7304280996322632
0 references
0.7191569209098816
0 references
0.7129420042037964
0 references
