An exact algorithm for the capacitated shortest spanning arborescence.
Paolo TothDaniele VigoPublished in: Ann. Oper. Res. (1995)
Keyphrases
- shortest path problem
- single source
- shortest path
- np hard
- routing problem
- lot sizing
- shortest common supersequence
- integer programming
- facility location
- branch and bound algorithm
- minimum weight
- multi commodity
- multi source
- capacity constraints
- vehicle routing problem
- weighted graph
- facility location problem
- multi period
- multi item
- path length
- production inventory
- routing algorithm
- max min
- network flow problem
- fixed charge
- minimum total cost
- data sources