Hybrid Algorithms for the Minimum-Weight Rooted Arborescence Problem.
Sergi MateoChristian BlumPascal FuaEngin TüretkenPublished in: ANTS (2012)
Keyphrases
- minimum weight
- hybrid algorithms
- bipartite graph
- hybrid algorithm
- spanning tree
- greedy heuristic
- weighted graph
- evolutionary algorithm
- hill climbing
- genetic algorithm
- minimum spanning tree
- metaheuristic
- randomized algorithm
- simulated annealing
- tabu search
- particle swarm optimization
- sat problem
- bi objective
- sat instances
- cost function
- policy evaluation
- search space