Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
From MaRDI portal
Publication:2892322
DOI10.1287/ijoc.1060.0191zbMath1241.90139OpenAlexW2110438635MaRDI QIDQ2892322
R. Kevin Wood, Johannes O. Royset
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c120847c613be7d649b0a755f82d8d4d14a36913
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)
Related Items (27)
Optimizing dynamic investment decisions for railway systems protection ⋮ Network interdiction via a critical disruption path: branch-and-price algorithms ⋮ Stochastic maximum flow interdiction problems under heterogeneous risk preferences ⋮ 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 ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem ⋮ Nodal interdiction ⋮ The stochastic interdiction median problem with disruption intensity levels ⋮ Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts ⋮ Protection of flows under targeted attacks ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ Shortest path network problems with stochastic arc weights ⋮ Analysis of critical damage in the communication network. III: Analysis of internode flows ⋮ Analysis of budget for interdiction on multicommodity network flows ⋮ Analysis of critical damage in the communication network. I: Model and computational experiment ⋮ A computational approach to determine damage in infrastructure networks from outage reports ⋮ Network interdiction to minimize the maximum probability of evasion with synergy between applied resources ⋮ Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems ⋮ The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability ⋮ On the power of randomization in network interdiction ⋮ An approach to the analysis of possible structural damages in multicommodity network systems ⋮ A survey of network interdiction models and algorithms ⋮ Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction ⋮ The continuous maximum capacity path interdiction problem ⋮ Attacker–defender models and road network vulnerability ⋮ 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: Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
