Exact Algorithms for the Bottleneck Steiner Tree Problem.
Sang Won BaeSunghee ChoiChunseok LeeShin-ichi TanigawaPublished in: ISAAC (2009)
Keyphrases
- exact algorithms
- steiner tree
- knapsack problem
- benchmark instances
- approximation algorithms
- vehicle routing problem with time windows
- exact solution
- combinatorial optimization problems
- benders decomposition
- combinatorial optimization
- multicast routing
- heuristic methods
- minimum spanning tree
- computational problems
- prize collecting
- shortest path
- max sat
- combinatorial problems
- heuristic search
- dynamic programming
- lower bound
- neural network
- greedy algorithm
- search algorithm