Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
From MaRDI portal
Publication:6547016
Recommendations
- Dynamic network interdiction problem with uncertain data
- Shortest path network interdiction with asymmetric uncertainty
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences
- A survey of network interdiction models and algorithms
- Shortest path network interdiction with incomplete information: a robust optimization approach
Cites work
- scientific article; zbMATH DE number 53116 (Why is no real title available?)
- scientific article; zbMATH DE number 1737519 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A brief overview of interdiction and robust optimization
- A new approach to the maximum-flow problem
- A simple greedy heuristic for linear assignment interdiction
- A survey of network interdiction models and algorithms
- An approach to the distributionally robust shortest path problem
- An integrated multi-product, multi-buyer supply chain under penalty, green, and quality control polices and a vendor managed inventory with consignment stock agreement: the outer approximation with equality relaxation and augmented penalty algorithm
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- Deterministic network interdiction
- Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics
- Evader interdiction: algorithms, complexity and collateral damage
- Exact solution of the robust knapsack problem
- Integer programming methods for solving binary interdiction games
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Minimizing a stochastic maximum-reliability path
- Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
- Modelling some robust design problems via conic optimization
- Multi-Period Max Flow Network Interdiction with Restructuring for Disrupting Domestic Sex Trafficking Networks
- Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach
- Multilevel approaches for the critical node problem
- Network deployment of radiation detectors with physics-based detection probability calculations
- Network flows. Theory, algorithms, and applications.
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Network interdiction with asymmetric cost uncertainty
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- On robust maximum flow with polyhedral uncertainty sets
- Online peer-to-peer lending platform and supply chain finance decisions and strategies
- Partitioning procedures for solving mixed-variables programming problems
- Recent advances in robust optimization: an overview
- Robust and adaptive network flows
- Robust discrete optimization and network flows
- Robust flows over time: models and complexity results
- Robust optimization
- Robust optimization-methodology and applications
- Robust solutions of uncertain linear programs
- Securing a border under asymmetric information
- Sequential Shortest Path Interdiction with Incomplete Information
- Sequential interdiction with incomplete information and learning
- Shortest path network interdiction with incomplete information: a robust optimization approach
- Shortest-path network interdiction
- Solving the bi-objective maximum-flow network-interdiction problem
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- The Benders decomposition algorithm: a literature review
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Price of Robustness
- The Value of Randomized Strategies in Distributionally Robust Risk-Averse Network Interdiction Problems
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The maximum flow problem of uncertain network
- The stochastic interdiction median problem with disruption intensity levels
- Theory and applications of robust optimization
Cited in
(2)
This page was built for publication: Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547016)
