An Observation about Circular Shortest Paths: Dealing with Additional Constraints Using Branch and Bound.
Pascal VallottonDavid LovellJanet NewmanPublished in: DICTA (2011)
Keyphrases
- branch and bound
- shortest path
- branch and bound algorithm
- lower bound
- optimal solution
- shortest path algorithm
- search algorithm
- search space
- column generation
- upper bound
- combinatorial optimization
- branch and bound method
- road network
- randomly generated problems
- branch and bound procedure
- tree search
- finding the shortest path
- max sat
- network design problem
- branch and bound search
- minimum cost flow
- optimal path
- weighted graph
- flow graph
- travel time
- lagrangian heuristic
- minimal surface
- depth first search
- neural network
- search tree
- search strategies
- tree search algorithm
- search strategy
- simulated annealing
- genetic algorithm