An exact algorithm for the capacitated shortest spanning arborescence (Q1908299): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:14, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for the capacitated shortest spanning arborescence |
scientific article |
Statements
An exact algorithm for the capacitated shortest spanning arborescence (English)
0 references
18 March 1996
0 references
capacitated shortest spanning arborescence
0 references
Lagrangian relaxation
0 references
heuristic algorithms
0 references
complete and loop-free digraph
0 references
routing
0 references
network design
0 references
branch-and-bound
0 references
