Pages that link to "Item:Q4785225"

The following pages link to Shortest-path network interdiction (Q4785225):

Displaying 50 items.

• A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem (Q4604908) (← links)
• A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
• Generalized Bounded Rationality and Robust Multicommodity Network Design (Q4969307) (← links)
• Sequential Interdiction with Incomplete Information and Learning (Q4971578) (← links)
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms (Q4994144) (← links)
• Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
• On the Independent Set Interdiction Problem (Q5006560) (← links)
• A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
• Bilevel Integer Programs with Stochastic Right-Hand Sides (Q5084620) (← links)
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
• A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid (Q5106423) (← links)
• Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
• Finding Critical Links for Closeness Centrality (Q5138269) (← links)
• Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
• Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
• Shortest path interdiction problem with arc improvement recourse: A multiobjective approach (Q5226166) (← links)
• An exact approach for the r-interdiction median problem with fortification (Q5242354) (← links)
• Selected Topics in Critical Element Detection (Q5260999) (← links)
• Network routing for insurgency: An adversarial risk analysis framework (Q5300454) (← links)
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
• Approximation Algorithms for k-Hurdle Problems (Q5458550) (← 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)
• A generic optimization framework for resilient systems (Q5882239) (← links)
• Vertex downgrading to minimize connectivity (Q6038644) (← links)
• Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720) (← links)
• Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
• The <i>r</i>‐interdiction selective multi‐depot vehicle routing problem (Q6067891) (← links)
• A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
• Logic-based Benders decomposition for wildfire suppression (Q6068720) (← links)
• Shortest path interdiction problem with convex piecewise-linear costs (Q6080429) (← links)
• The stochastic critical node problem over trees (Q6092626) (← links)
• A survey on bilevel optimization under uncertainty (Q6096565) (← links)
• Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• On designing networks resilient to clique blockers (Q6106962) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems (Q6164359) (← links)
• An exact method for binary fortification games (Q6167322) (← links)
• A two‐stage network interdiction‐monitoring game (Q6179685) (← 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)
• Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption (Q6547016) (← links)