Heuristic and exact algorithms for minimum-weight non-spanning arborescences

Mathematics

• Heuristic algorithm 100%
• Exact Algorithms 95%
• Iterated Local Search 72%
• Linear Relaxation 57%
• Branch-and-cut 55%
• Reduced Model 53%
• Integer Linear Programming 51%
• Cutset 51%
• Exact Method 50%
• Vertex of a graph 48%
• Weighted Graph 44%
• Computational Results 41%
• Heuristics 36%
• Optimal Solution 35%
• Polynomial time 33%
• NP-complete problem 32%
• Formulation 26%
• Model 13%

Business & Economics

• Heuristic Algorithm 96%
• Iterated Local Search 65%
• Integer Linear Programming 54%
• NP-hard 44%
• Polynomials 41%
• Graph 40%
• Optimal Solution 36%
• Heuristics 33%

Engineering & Materials Science

• Heuristic algorithms 84%
• NP-hard 40%
• Linear programming 39%
• Polynomials 32%
• Set theory 27%