An exact algorithm for the capacitated shortest spanning arborescence (Q1908299)
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: An exact algorithm for the capacitated shortest spanning arborescence |
scientific article; zbMATH DE number 847659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the capacitated shortest spanning arborescence |
scientific article; zbMATH DE number 847659 |
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
0 references
