Pages that link to "Item:Q4692013"

The following pages link to Sequential Shortest Path Interdiction with Incomplete Information (Q4692013):

Displaying 19 items.

• A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs (Q1735189) (← links)
• The continuous maximum capacity path interdiction problem (Q2083925) (← links)
• Network interdiction with asymmetric cost uncertainty (Q2242212) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• On the multistage shortest path problem under distributional uncertainty (Q2697006) (← links)
• Timely Decision Analysis Enabled by Efficient Social Media Modeling (Q4692041) (← links)
• Sequential Interdiction with Incomplete Information and Learning (Q4971578) (← links)
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms (Q4994144) (← links)
• Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
• On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
• Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire (Q5865822) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback (Q5868922) (← links)
• Shortest path interdiction problem with convex piecewise-linear costs (Q6080429) (← links)
• A survey on bilevel optimization under uncertainty (Q6096565) (← links)
• Interdicting restructuring networks with applications in illicit trafficking (Q6112570) (← links)
• Two-stage nodal network interdiction under decision-dependent uncertainty (Q6547014) (← links)
• Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption (Q6547016) (← links)
• Shortest path network interdiction with incomplete information: a robust optimization approach (Q6547018) (← links)