A tight bound on the speed-up through storage for quickest multi-commodity flows.
Martin GroßMartin SkutellaPublished in: Oper. Res. Lett. (2015)
Keyphrases
- search space
- multi commodity
- lower bound
- heuristic solution
- upper bound
- optimal solution
- facility location
- branch and bound
- worst case
- max min
- network flow problem
- lagrangian relaxation
- np hard
- exhaustive search
- branch and bound algorithm
- objective function
- knapsack problem
- lower and upper bounds
- miller tucker zemlin
- network design problem
- exact solution
- linear programming
- min max
- minimal cost
- integer programming