Pages that link to "Item:Q2270321"

The following pages link to The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321):

Displaying 42 items.

• Minimum edge blocker dominating set problem (Q319914) (← links)
• Optimizing dynamic investment decisions for railway systems protection (Q320718) (← links)
• A computational approach to determine damage in infrastructure networks from outage reports (Q523173) (← links)
• Minimum cost edge blocker clique problem (Q827246) (← links)
• Interdiction problems on planar graphs (Q897609) (← links)
• Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
• Stochastic maximum flow interdiction problems under heterogeneous risk preferences (Q1652509) (← links)
• Recovery strategies from major supply disruptions in single and multiple sourcing networks (Q1713742) (← links)
• An exact approach for the \(r\)-interdiction covering problem with fortification (Q1725826) (← links)
• Protection of flows under targeted attacks (Q1727948) (← links)
• Bilevel model for adaptive network flow problem (Q1742209) (← links)
• Parametric multiroute flow and its application to multilink-attack network (Q1751172) (← links)
• Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications (Q1751884) (← links)
• Perfect matching interdiction problem restricted to a stable vertex (Q1794725) (← links)
• Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs (Q1999634) (← links)
• The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs (Q2050253) (← links)
• An approximation algorithm for network flow interdiction with unit costs and two capacities (Q2056900) (← links)
• Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
• The continuous maximum capacity path interdiction problem (Q2083925) (← links)
• Exact and approximation algorithms for sensor placement against DDoS attacks (Q2140977) (← links)
• Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
• A bi-level model and memetic algorithm for arc interdiction location-routing problem (Q2244003) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut (Q2299979) (← links)
• A decomposition approach for stochastic shortest-path network interdiction with goal threshold (Q2311034) (← links)
• Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach (Q2442080) (← links)
• An iterative security game for computing robust and adaptive network flows (Q2669664) (← links)
• Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach (Q2676287) (← links)
• An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← links)
• Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers (Q2980027) (← links)
• Approximation algorithm for maximum flow network interdiction problem (Q3389526) (← links)
• Hardness and approximation for network flow interdiction (Q4638580) (← links)
• (Q4703380) (← links)
• Symmetric interdiction for matching problems (Q5002612) (← links)
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire (Q5865822) (← links)
• On designing networks resilient to clique blockers (Q6106962) (← links)
• How vulnerable is an undirected planar graph with respect to max flow (Q6196897) (← 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)
• The all-pairs vitality-maximization (VIMAX) problem (Q6588518) (← links)