Removing Arcs from a Network
From MaRDI portal
Cited in
(88)- The most vital edges in the minimum spanning tree problem
- 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
- Protection of flows under targeted attacks
- Optimizing fortification plan of capacitated facilities with maximum distance limits
- Bilevel model for adaptive network flow problem
- Parametric multiroute flow and its application to multilink-attack network
- An analytical approach to the protection planning of a rail intermodal terminal network
- An interdiction game on a queueing network with multiple intruders
- Efficient determination of the k most vital edges for the minimum spanning tree problem
- On the power of randomization in network interdiction
- Deterministic network interdiction
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- The stochastic interdiction median problem with disruption intensity levels
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Network interdiction with asymmetric cost uncertainty
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- Convex hull representation of the deterministic bipartite network interdiction problem
- A survey of network interdiction models and algorithms
- A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities
- Solving multi-period interdiction via generalized Bender's decomposition
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Survivable network design under optimal and heuristic interdiction scenarios
- A bilevel mixed-integer program for critical infrastructure protection planning
- An exact solution approach for the interdiction median problem with fortification
- VNS solutions for the critical node problem
- A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection
- An iterative security game for computing robust and adaptive network flows
- Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach
- Hybrid constructive heuristics for the critical node problem
- Risk-averse shortest path interdiction
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- Minimizing a stochastic maximum-reliability path
- Reformulation and sampling to solve a stochastic network interdiction problem
- Shortest path network interdiction with asymmetric information
- Minimum edge blocker dominating set problem
- Optimizing dynamic investment decisions for railway systems protection
- A genetic algorithm for a class of critical node problems
- A brief overview of interdiction and robust optimization
- A class of algorithms for mixed-integer bilevel min-max optimization
- 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
- The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
- A bi-level programming model for protection of hierarchical facilities under imminent attacks
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- A defensive maximal covering problem on a network
- Finding the foremost ares in a network with parametric are capacities
- Detecting critical node structures on graphs: a mathematical programming approach
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Sequential Shortest Path Interdiction with Incomplete Information
- A unified framework for multistage mixed integer linear optimization
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Designing a model for service facility protection with a time horizon based on tri-level programming
- 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
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Mitigating interdiction risk with fortification
- Analysis of budget for interdiction on multicommodity network flows
- Bi-objective optimization models for network interdiction
- Selected topics in critical element detection
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- A generic optimization framework for resilient systems
- The r‐interdiction selective multi‐depot vehicle routing problem
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- Logic-based Benders decomposition for wildfire suppression
- On designing networks resilient to clique blockers
- Designing robust coverage networks to hedge against worst-case facility losses
- A two‐stage network interdiction‐monitoring game
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set
- Attack and interception in networks
- Two-stage nodal network interdiction under decision-dependent uncertainty
- A (B + 1)-approximation for network flow interdiction with unit costs
- k-submodular interdiction problems under distributional risk-receptiveness and robustness: application to machine learning
- Robust static and dynamic maximum flows
- The Maximal covering location disruption problem
- Integer linear programming formulations for the maximum flow blocker problem
- A modified scenario bundling method for shortest path network interdiction under endogenous uncertainty
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- The multi-terminal maximum-flow network-interdiction problem
- Minimum cost edge blocker clique problem
- Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
- Network flow interdiction on planar graphs
This page was built for publication: Removing Arcs from a Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5602573)
