Circular shortest paths by branch and bound.
Ben AppletonChangming SunPublished in: Pattern Recognit. (2003)
Keyphrases
- branch and bound
- shortest path
- lower bound
- search algorithm
- branch and bound algorithm
- upper bound
- optimal solution
- shortest path algorithm
- column generation
- search space
- road network
- combinatorial optimization
- tree search
- branch and bound method
- branch and bound procedure
- randomly generated problems
- path length
- weighted graph
- travel time
- network design problem
- lagrangian heuristic
- search strategies
- depth first search
- max sat
- geodesic distance
- simulated annealing
- optimal path
- flow graph
- neural network
- tree search algorithm
- strongly connected components
- branch and bound search
- np hard
- finding the shortest path
- cost function