Deterministic network interdiction
From MaRDI portal
Publication:1804095
DOI10.1016/0895-7177(93)90236-RzbMath0800.90772MaRDI QIDQ1804095
Publication date: 29 June 1993
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal ⋮ A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ Minimizing a stochastic maximum-reliability path ⋮ Shortest path network interdiction with asymmetric information ⋮ Probability Distributions on Partially Ordered Sets and Network Interdiction Games ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ Bilevel Integer Programs with Stochastic Right-Hand Sides ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction ⋮ Vertex downgrading to minimize connectivity ⋮ Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem ⋮ The stochastic critical node problem over trees ⋮ On designing networks resilient to clique blockers ⋮ Interdicting restructuring networks with applications in illicit trafficking ⋮ Robust flows with adaptive mitigation ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Unnamed Item ⋮ A two‐stage network interdiction‐monitoring game ⋮ Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set ⋮ Robust capacitated Steiner trees and networks with uniform demands ⋮ Attack and interception in networks ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem ⋮ On Bilevel Optimization with Inexact Follower ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers ⋮ Mitigating Interdiction Risk with Fortification ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Ambulance Emergency Response Optimization in Developing Countries ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures ⋮ Deception tactics for network interdiction: A multiobjective approach ⋮ Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs ⋮ A defensive maximal covering problem on a network ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ Approximation Algorithms for k-Hurdle Problems ⋮ Sequential Interdiction with Incomplete Information and Learning ⋮ Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction ⋮ The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms ⋮ Multilevel Approaches for the Critical Node Problem ⋮ Bi-objective optimization models for network interdiction ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Selected Topics in Critical Element Detection ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire ⋮ Complexity of the multilevel critical node problem ⋮ Interdicting facilities in tree networks ⋮ Hybrid constructive heuristics for the critical node problem ⋮ Circular and radial design comparison of survivability in asymmetrical hierarchical networks ⋮ A cutting plane algorithm for computing \(k\)-edge survivability of a network ⋮ Minimum cost edge blocker clique problem ⋮ Infrastructure security games ⋮ 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 ⋮ VNS solutions for the critical node problem ⋮ Exact and approximation algorithms for sensor placement against DDoS attacks ⋮ Minimum edge blocker dominating set problem ⋮ Optimizing dynamic investment decisions for railway systems protection ⋮ A bilevel formulation of the pediatric vaccine pricing problem ⋮ The \(q\)-ad hoc hub location problem for multi-modal networks ⋮ A genetic algorithm for a class of critical node problems ⋮ A class of algorithms for mixed-integer bilevel min-max optimization ⋮ Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption ⋮ Network interdiction via a critical disruption path: branch-and-price algorithms ⋮ A bilevel partial interdiction problem with capacitated facilities and demand outsourcing ⋮ Protection issues for supply systems involving random attacks ⋮ A bilevel exposure-oriented sensor location problem for border security ⋮ A mixed-integer programming approach for locating jamming devices in a flow-jamming attack ⋮ The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm ⋮ Applying ranking and selection procedures to long-term mitigation for improved network restoration ⋮ 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 ⋮ Critical edges/nodes for the minimum spanning tree problem: complexity and approximation ⋮ Solving multi-period interdiction via generalized Bender's decomposition ⋮ Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning ⋮ Matching interdiction ⋮ Exact interdiction models and algorithms for disconnecting networks via node deletions ⋮ An iterative security game for computing robust and adaptive network flows ⋮ A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths ⋮ Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges ⋮ The connected critical node problem ⋮ Designing robust coverage networks to hedge against worst-case facility losses ⋮ Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach ⋮ Branch and cut algorithms for detecting critical nodes in undirected graphs ⋮ Nodal interdiction ⋮ The most vital nodes with respect to independent set and vertex cover ⋮ Interdiction problems on planar graphs ⋮ Approximation algorithms for \(k\)-hurdle problems ⋮ Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems ⋮ The stochastic interdiction median problem with disruption intensity levels ⋮ Algorithms and complexity analysis for robust single-machine scheduling problems ⋮ A cutting-plane algorithm for solving a weighted influence interdiction problem ⋮ Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes ⋮ Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
Uses Software
Cites Work
- Edmonds polytopes and a hierarchy of combinatorial problems
- Solving Large-Scale Zero-One Linear Programming Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Finding the n Most Vital Links in Flow Networks
- Facets of the knapsack polytope
- Removing Arcs from a Network
- Optimal interdiction policy for a flow network
- Optimal interdiction of a supply network
- Determining the most vital link in a flow network
- Unnamed Item
- Unnamed Item
This page was built for publication: Deterministic network interdiction
