Heuristic and exact algorithms for minimum-weight non-spanning arborescences.
Marcus RittJordi PereiraPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- exact algorithms
- minimum weight
- greedy heuristic
- knapsack problem
- approximation algorithms
- bipartite graph
- exact solution
- spanning tree
- minimum spanning tree
- heuristic methods
- max sat
- np hard
- weighted graph
- combinatorial optimization problems
- combinatorial optimization
- optimal solution
- combinatorial problems
- greedy algorithm
- lower bound
- cost function
- dynamic programming
- optimization problems
- linear programming
- worst case
- scheduling problem
- xml documents
- relational databases
- randomized algorithm
- tabu search