Optimal crashing of an activity network with disruptions

Keyphrases

• Active Networks 100%
• Branch-and-cut 50%
• Computationally Expensive 50%
• Crash 100%
• Decomposition Algorithm 100%
• Linear Programming 50%
• Mixed Integer Programming 50%
• NP-hard 50%
• Optimality Gap 50%
• Optimization Problem 50%
• Recourse Problem 100%
• Sample Average Approximation 50%
• Sampling numbers 50%
• Solution Time 50%
• Spatial Branching Processes 50%
• Tight 50%
• Two-stage Stochastic Integer Programming 50%
• Variable Programming 50%

Computer Science

• Activity Network 100%
• Approximation (Algorithm) 100%
• Branch and Cut 50%
• Continuous Variable 50%
• Integer Program 100%
• Linear Programming 50%
• Optimization Problem 50%

Mathematics

• Continuous Variable 50%
• Decomposition Algorithms 100%
• Integer 100%
• Linear Programming 50%
• Optimality 50%
• Sample Average 50%
• Stochastics 50%