Login / Signup
Efficient frameworks for greedy split and new depth first search split procedures for routing problems.
Christophe Duhamel
Philippe Lacomme
Caroline Prodhon
Published in:
Comput. Oper. Res. (2011)
Keyphrases
</>
depth first search
routing problem
breadth first search
search tree
vehicle routing problem
tree search
routing algorithm
search algorithm
spanning tree
neural network
genetic algorithm
search space
cost function
dynamic programming
shortest path
branch and bound