Min-Max vs. Min-Sum Vehicle Routing: A worst-case analysis.
Luca BertazziBruce L. GoldenXingyin WangPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- min max
- vehicle routing
- worst case analysis
- min sum
- np hard
- np hardness
- worst case
- lower bound
- vehicle routing problem
- greedy heuristic
- average case
- column generation
- linear programming relaxation
- travel time
- goal programming
- routing problem
- approximation algorithms
- linear programming
- branch and bound
- upper bound
- integer programming
- optimal solution
- np complete
- special case
- linear program
- min cut
- computational complexity
- scheduling problem
- minimum cost
- knapsack problem
- integer program
- combinatorial optimization
- lagrangian relaxation
- metaheuristic