A tight bound on the speed-up through storage for quickest multi-commodity flows.
Martin GroßMartin SkutellaPublished in: CoRR (2014)
Keyphrases
- multi commodity
- lower bound
- heuristic solution
- upper bound
- facility location
- worst case
- max min
- lagrangian relaxation
- optimal solution
- branch and bound
- branch and bound algorithm
- network flow problem
- miller tucker zemlin
- network design
- objective function
- lower and upper bounds
- np hard
- network design problem
- feasible solution
- genetic algorithm
- cutting plane
- minimum cost
- exhaustive search