An exact algorithm for the capacitated shortest spanning arborescence (Q1908299): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: VRP / rank | |||
Normal rank | |||
Revision as of 09:48, 28 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
