Exact Algorithms for the Bottleneck Steiner Tree Problem.
Sang Won BaeSunghee ChoiChunseok LeeShin-ichi TanigawaPublished in: Algorithmica (2011)
Keyphrases
- exact algorithms
- steiner tree
- knapsack problem
- exact solution
- approximation algorithms
- vehicle routing problem with time windows
- benchmark instances
- benders decomposition
- combinatorial optimization
- combinatorial optimization problems
- heuristic methods
- computational problems
- max sat
- prize collecting
- minimum spanning tree
- multicast routing
- orders of magnitude
- shortest path
- combinatorial problems
- np hard
- search algorithm
- utility function
- multi objective