The (K, k)-capacitated spanning tree problem.
Esther M. ArkinNili Guttmann-BeckRefael HassinPublished in: Discret. Optim. (2012)
Keyphrases
- interval data
- spanning tree
- lot sizing
- multi item
- routing problem
- single source
- capacity constraints
- multi source
- facility location
- minmax regret
- multi period
- facility location problem
- minimum total cost
- vehicle routing problem
- np hard
- vehicle routing problem with stochastic demands
- production inventory
- minimum cost
- network design problem
- multi commodity
- multicommodity flow
- network flow problem
- planning horizon
- special case
- data sets