A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem.
Matteo FischettiDaniele VigoPublished in: Networks (1997)
Keyphrases
- minimum weight
- resource constrained
- greedy heuristic
- cost function
- dynamic programming
- minimum spanning tree
- spanning tree
- bipartite graph
- learning algorithm
- maximum cardinality
- segmentation algorithm
- optimal solution
- particle swarm optimization
- benchmark problems
- tree structure
- ant colony optimization
- metaheuristic
- optimization problems
- computational complexity