Pages that link to "Item:Q3184598"

The following pages link to Shortest path network interdiction with asymmetric information (Q3184598):

Displaying 34 items.

• Optimizing dynamic investment decisions for railway systems protection (Q320718) (← links)
• A computational approach to determine damage in infrastructure networks from outage reports (Q523173) (← links)
• Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications (Q1751884) (← links)
• On a class of bilevel linear mixed-integer programs in adversarial settings (Q1754450) (← links)
• Network interdiction to minimize the maximum probability of evasion with synergy between applied resources (Q1761829) (← links)
• On the power of randomization in network interdiction (Q1785482) (← links)
• The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
• The continuous maximum capacity path interdiction problem (Q2083925) (← links)
• Network interdiction with asymmetric cost uncertainty (Q2242212) (← links)
• A bi-level model and memetic algorithm for arc interdiction location-routing problem (Q2244003) (← links)
• Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• A decomposition approach for stochastic shortest-path network interdiction with goal threshold (Q2311034) (← links)
• Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction (Q2357244) (← links)
• Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
• A Brief Overview of Interdiction and Robust Optimization (Q3299227) (← links)
• Deception tactics for network interdiction: A multiobjective approach (Q4648690) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms (Q4994144) (← links)
• A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
• Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
• Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
• Network routing for insurgency: An adversarial risk analysis framework (Q5300454) (← 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)
• Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set (Q6179697) (← links)
• Shortest path network interdiction with asymmetric uncertainty (Q6196902) (← links)
• Two-stage nodal network interdiction under decision-dependent uncertainty (Q6547014) (← links)
• Shortest path network interdiction with incomplete information: a robust optimization approach (Q6547018) (← links)
• An optimal algorithm for variable knockout problems (Q6655140) (← links)
• Monte Carlo tree search for dynamic shortest-path interdiction (Q6659083) (← links)