Exact algorithms and bounds for the dynamic assignment interdiction problem

Mathematics

• Arc of a curve 46%
• Assign 27%
• Assignment 76%
• Assignment Problem 96%
• Cardinality Constraints 19%
• Costs 30%
• Dynamic Problem 93%
• Dynamic Programming 13%
• Exact Algorithms 93%
• Game 33%
• Graph in graph theory 6%
• Maximise 13%
• NP-complete problem 10%
• Objective function 11%
• Optimal Strategy 15%
• Optimization Model 17%
• Robust Optimization 18%
• Subset 7%
• Upper and Lower Bounds 11%
• Vary 11%

Business & Economics

• Assignment 58%
• Assignment Game 52%
• Assignment Problem 100%
• Costs 19%
• Dynamic Programming 16%
• Graph 15%
• Lower Bounds 16%
• NP-hard 17%
• Objective Function 15%
• Optimal Strategy 16%
• Optimization Model 16%
• Robust Optimization 20%
• Upper Bound 17%

Engineering & Materials Science

• Costs 31%
• Dynamic programming 27%
• NP-hard 26%