A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree.
Igor AverbakhOded BermanPublished in: Discret. Appl. Math. (1996)
Keyphrases
- worst case analysis
- worst case
- average case
- routing problem
- greedy heuristic
- game tree
- traveling salesman problem
- tree search
- np hardness
- linear programming relaxation
- approximation algorithms
- alpha beta
- routing algorithm
- lower bound
- greedy algorithm
- np hard
- shortest path
- limited capacity
- routing protocol
- supervised learning
- upper bound
- genetic algorithm