Accelerating the Performance of Parallel Depth-First-Search Branch-and-Bound Algorithm in Transportation Network Design Problem.
Amirali ZarrinmehrYousef ShafahiPublished in: ICORES (2015)
Keyphrases
- depth first search
- branch and bound
- branch and bound algorithm
- network design problem
- search tree
- lower bound
- search algorithm
- tree search
- lagrangian relaxation
- upper bound
- column generation
- optimal solution
- search space
- combinatorial optimization
- integer variables
- transportation networks
- np hard
- traveling salesman problem
- neural network
- objective function
- genetic algorithm