Solving the bi-objective maximum-flow network-interdiction problem
From MaRDI portal
Recommendations
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
- Approximation algorithm for maximum flow network interdiction problem
- The multi-terminal maximum-flow network-interdiction problem
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- Shortest-path network interdiction
Cited in
(41)- Stochastic maximum flow interdiction problems under heterogeneous risk preferences
- Protection of flows under targeted attacks
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- On the power of randomization in network interdiction
- The stochastic interdiction median problem with disruption intensity levels
- Analysis of critical damage in the communication network. I: Model and computational experiment
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
- The continuous maximum capacity path interdiction problem
- Shortest path network problems with stochastic arc weights
- Analysis of critical damage in the communication network. III: Analysis of internode flows
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- An approach to the analysis of possible structural damages in multicommodity network systems
- A survey of network interdiction models and algorithms
- Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
- Solving multi-period interdiction via generalized Bender's decomposition
- Optimizing dynamic investment decisions for railway systems protection
- A brief overview of interdiction and robust optimization
- Network interdiction via a critical disruption path: branch-and-price algorithms
- Successive quadratic upper-bounding for discrete mean-risk minimization and network interdiction
- Approximation algorithm for maximum flow network interdiction problem
- Bi-objective min-flow problem with capacity and flow constraints
- Nodal interdiction
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- 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
- Analysis of budget for interdiction on multicommodity network flows
- A computational approach to determine damage in infrastructure networks from outage reports
- Bi-objective optimization models for network interdiction
- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
- Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems
- 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
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
- A (B + 1)-approximation for network flow interdiction with unit costs
- The all-pairs vitality-maximization (VIMAX) problem
- Monte Carlo tree search for dynamic shortest-path interdiction
- The Maximal covering location disruption problem
- Integer linear programming formulations for the maximum flow blocker problem
- The multi-terminal maximum-flow network-interdiction problem
This page was built for publication: Solving the bi-objective maximum-flow network-interdiction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892322)
