Pages that link to "Item:Q2294622"

The following pages link to A survey of network interdiction models and algorithms (Q2294622):

Displaying 38 items.

• Improving connectivity of compromised digital networks via algebraic connectivity maximisation (Q2031111) (← links)
• Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
• The continuous maximum capacity path interdiction problem (Q2083925) (← links)
• OR for entrepreneurial ecosystems: a problem-oriented review and agenda (Q2116897) (← links)
• Interdicting facilities in tree networks (Q2121611) (← links)
• A bilevel optimization approach to decide the feasibility of bookings in the European gas market (Q2155380) (← links)
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
• The minmax regret inverse maximum weight problem (Q2243298) (← links)
• A bi-level model and memetic algorithm for arc interdiction location-routing problem (Q2244003) (← links)
• A Markov decision process model on dynamic routing for target surveillance (Q2669763) (← links)
• A data-driven matching algorithm for ride pooling problem (Q2669782) (← links)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
• Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal (Q5051378) (← links)
• A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← 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)
• Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback (Q5868922) (← links)
• A generic optimization framework for resilient systems (Q5882239) (← links)
• Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
• On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows (Q6065863) (← 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)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• Interdicting restructuring networks with applications in illicit trafficking (Q6112570) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• Parametric matroid interdiction (Q6122085) (← links)
• On robustness in nonconvex optimization with application to defense planning (Q6161271) (← links)
• An exact method for binary fortification games (Q6167322) (← links)
• Optimization strategies for the bilevel network design problem with affine cost functions (Q6168127) (← links)
• Mathematical programming formulations for the collapsed k-core problem (Q6168587) (← links)
• A two‐stage network interdiction‐monitoring game (Q6179685) (← links)
• Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)
• Attack and interception in networks (Q6180414) (← links)
• Shortest path network interdiction with asymmetric uncertainty (Q6196902) (← links)