Removing Arcs from a Network

DOI10.1287/opre.12.6.934zbMath0204.20102OpenAlexW2045640143MaRDI QIDQ5602573

Richard D. Wollmer

Publication date: 1964

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.12.6.934

Related Items (81)

A generic optimization framework for resilient systems ⋮ Hybrid constructive heuristics for the critical node problem ⋮ Minimum cost edge blocker clique 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 ⋮ VNS solutions for the critical node problem ⋮ 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 ⋮ Minimum edge blocker dominating set problem ⋮ Optimizing dynamic investment decisions for railway systems protection ⋮ A genetic algorithm for a class of critical node problems ⋮ Minimizing a stochastic maximum-reliability path ⋮ Reformulation and sampling to solve a stochastic network interdiction problem ⋮ Shortest path network interdiction with asymmetric information ⋮ A class of algorithms for mixed-integer bilevel min-max optimization ⋮ Finding the foremost ares in a network with parametric are capacities ⋮ 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 ⋮ Probability Distributions on Partially Ordered Sets and Network Interdiction Games ⋮ Critical edges/nodes for the minimum spanning tree problem: complexity and approximation ⋮ Solving multi-period interdiction via generalized Bender's decomposition ⋮ 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 ⋮ A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection ⋮ An iterative security game for computing robust and adaptive network flows ⋮ Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction ⋮ 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 ⋮ 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 ⋮ Branch and cut algorithms for detecting critical nodes in undirected graphs ⋮ On designing networks resilient to clique blockers ⋮ 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 ⋮ The stochastic interdiction median problem with disruption intensity levels ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth ⋮ Mitigating Interdiction Risk with Fortification ⋮ A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Protection of flows under targeted attacks ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ Optimizing fortification plan of capacitated facilities with maximum distance limits ⋮ Survivable network design under optimal and heuristic interdiction scenarios ⋮ A bilevel mixed-integer program for critical infrastructure protection planning ⋮ Bilevel model for adaptive network flow problem ⋮ Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure ⋮ Network interdiction with asymmetric cost uncertainty ⋮ A bi-level model and memetic algorithm for arc interdiction location-routing problem ⋮ New solution approaches for the maximum-reliability stochastic network interdiction problem ⋮ Analysis of budget for interdiction on multicommodity network flows ⋮ Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs ⋮ Parametric multiroute flow and its application to multilink-attack network ⋮ Convex hull representation of the deterministic bipartite network interdiction problem ⋮ An analytical approach to the protection planning of a rail intermodal terminal network ⋮ An interdiction game on a queueing network with multiple intruders ⋮ An exact solution approach for the interdiction median problem with fortification ⋮ Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem ⋮ The most vital edges in the minimum spanning tree problem ⋮ 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 ⋮ Network flow interdiction on planar graphs ⋮ A defensive maximal covering problem on a network ⋮ On the power of randomization in network interdiction ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ A survey of network interdiction models and algorithms ⋮ Deterministic network interdiction ⋮ An approximation algorithm for network flow interdiction with unit costs and two capacities ⋮ Risk-Averse Shortest Path Interdiction ⋮ Bi-objective optimization models for network interdiction ⋮ A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities ⋮ A framework for generalized Benders' decomposition and its application to multilevel optimization ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization ⋮ 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

This page was built for publication: Removing Arcs from a Network