Deterministic network interdiction

DOI10.1016/0895-7177(93)90236-RzbMATH Open0800.90772MaRDI QIDQ1804095FDOQ1804095

R. Kevin Wood

Publication date: 29 June 1993

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2050723
• The multi-terminal maximum-flow network-interdiction problem
• Exact algorithms for solving a Euclidean maximum flow network interdiction problem
• A dynamic network interdiction problem
• Reformulation and sampling to solve a stochastic network interdiction problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Cites Work

• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Title not available (Why is that?)
• Solving Large-Scale Zero-One Linear Programming Problems
• Facets of the knapsack polytope
• Title not available (Why is that?)
• Removing Arcs from a Network
• Finding the n Most Vital Links in Flow Networks
• Edmonds polytopes and a hierarchy of combinatorial problems
• Optimal interdiction policy for a flow network
• Optimal interdiction of a supply network
• Determining the most vital link in a flow network

Cited In (only showing first 100 items - show all)

• Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
• Survivable network design under optimal and heuristic interdiction scenarios
• Minimizing a stochastic maximum-reliability path
• A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
• Nodal interdiction
• Hybrid constructive heuristics for the critical node problem
• Shortest path network interdiction with asymmetric information
• Selected Topics in Critical Element Detection
• Designing robust coverage networks to hedge against worst-case facility losses
• A genetic algorithm for a class of critical node problems
• The continuous maximum capacity path interdiction problem
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• The stochastic critical node problem over trees
• The multi-terminal maximum-flow network-interdiction problem
• Critical infrastructure protection using secrecy -- a discrete simultaneous game
• Infrastructure security games
• The \(q\)-ad hoc hub location problem for multi-modal networks
• Connectivity interdiction
• The stochastic interdiction median problem with disruption intensity levels
• Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
• Minimum edge blocker dominating set problem
• Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
• The most vital nodes with respect to independent set and vertex cover
• Title not available (Why is that?)
• Blockers for the stability number and the chromatic number
• Interdicting facilities in tree networks
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Bi-objective optimization models for network interdiction
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
• A bilevel formulation of the pediatric vaccine pricing problem
• Optimizing dynamic investment decisions for railway systems protection
• Matching interdiction
• Network interdiction via a critical disruption path: branch-and-price algorithms
• Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption
• Network flow interdiction on planar graphs
• A bilevel mixed-integer program for critical infrastructure protection planning
• A bi-level model and memetic algorithm for arc interdiction location-routing problem
• A class of algorithms for mixed-integer bilevel min-max optimization
• Protection issues for supply systems involving random attacks
• The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
• Approximation Algorithms for k-Hurdle Problems
• On short paths interdiction problems: Total and node-wise limited interdiction
• Approximation algorithms for \(k\)-hurdle problems
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Jamming communication networks under complete uncertainty
• Applying ranking and selection procedures to long-term mitigation for improved network restoration
• Algorithms and complexity analysis for robust single-machine scheduling problems
• A bi-level programming model for protection of hierarchical facilities under imminent attacks
• Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
• VNS solutions for the critical node problem
• Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures
• A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
• Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
• Bilevel Integer Programs with Stochastic Right-Hand Sides
• A defensive maximal covering problem on a network
• A dynamic reformulation heuristic for generalized interdiction problems
• An analytical approach to the protection planning of a rail intermodal terminal network
• Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
• A cutting plane algorithm for computing \(k\)-edge survivability of a network
• Analysis of budget for interdiction on multicommodity network flows
• An adaptive robust framework for the optimization of the resilience of interdependent infrastructures under natural hazards
• The critical node detection problem in networks: a survey
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• Network interdiction with asymmetric cost uncertainty
• A simple greedy heuristic for linear assignment interdiction
• An exact solution approach for the interdiction median problem with fortification
• A decomposition approach for stochastic shortest-path network interdiction with goal threshold
• A computational approach to determine damage in infrastructure networks from outage reports
• On the power of randomization in network interdiction
• Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes
• Minimum cost edge blocker clique problem
• Probability estimation via policy restrictions, convexification, and approximate sampling
• Exact and approximation algorithms for sensor placement against DDoS attacks
• Protection of flows under targeted attacks
• Submodularity in Conic Quadratic Mixed 0–1 Optimization
• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
• Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
• Multilevel Approaches for the Critical Node Problem
• A Unified Framework for Multistage Mixed Integer Linear Optimization
• Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction
• Wireless LAN transmitter location under the threat of jamming attacks
• Optimal detection of critical nodes: improvements to model structure and performance
• New solution approaches for the maximum-reliability stochastic network interdiction problem
• Bilevel model for adaptive network flow problem
• Complexity of the multilevel critical node problem
• Parametric multiroute flow and its application to multilink-attack network
• An interdiction game on a queueing network with multiple intruders
• Risk-averse stochastic path detection
• On a class of bilevel linear mixed-integer programs in adversarial settings
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
• Exact algorithms for the minimum cost vertex blocker clique problem
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
• Deception tactics for network interdiction: A multiobjective approach
• Equilibrium strategies for multiple interdictors on a common network
• A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
• A bilevel exposure-oriented sensor location problem for border security

Uses Software

• LINDO

This page was built for publication: Deterministic network interdiction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804095)