An algorithm for embedding a class of non-even routing problems in even routing problems.
Dee ParksMiroslaw TruszczynskiPublished in: Great Lakes Symposium on VLSI (1992)
Keyphrases
- routing problem
- depth first search
- vehicle routing problem
- cost function
- vehicle routing problem with time windows
- objective function
- dynamic programming
- worst case
- cutting plane algorithm
- np hard
- search space
- video sequences
- benchmark problems
- computational complexity
- data mining
- simulated annealing
- heuristic search
- routing algorithm
- variable neighborhood search