Maximum arc-disjoint and node-disjoint flows in two-commodity networks (Q1156680)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum arc-disjoint and node-disjoint flows in two-commodity networks |
scientific article |
Statements
Maximum arc-disjoint and node-disjoint flows in two-commodity networks (English)
0 references
1981
0 references
maximum arc-disjoint flows
0 references
node-disjoint flows
0 references
two-commodity networks
0 references
multi-commodity network
0 references
branch-and-bound algorithm
0 references
heuristic methods
0 references
near-optimum solutions
0 references
