Heuristic and exact algorithms for the spanning tree detection problem.
Takeo YamadaSeiji KataokaKohtaro WatanabePublished in: Comput. Oper. Res. (2005)
Keyphrases
- exact algorithms
- spanning tree
- approximation algorithms
- knapsack problem
- benchmark instances
- minimum cost
- exact solution
- minimum spanning tree
- heuristic methods
- benders decomposition
- vehicle routing problem with time windows
- minimum weight
- combinatorial optimization
- minimum spanning trees
- combinatorial optimization problems
- np hard
- max sat
- undirected graph
- weighted graph
- combinatorial problems
- lower bound
- metaheuristic
- dynamic programming