Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
From MaRDI portal
Publication:6547016
DOI10.1007/S10479-023-05812-6zbMATH Open1547.90216WikidataQ129964837 ScholiaQ129964837MaRDI QIDQ6547016
Priyadarshan N. Patil, Darshan Chauhan, Avinash Unnikrishnan, Stephen D. Boyles
Publication date: 30 May 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
uncertaintyLagrangian relaxationrobust optimizationmaximum flowBenders' decompositionnetwork interdiction
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact solution of the robust knapsack problem
- Evader interdiction: algorithms, complexity and collateral damage
- A simple greedy heuristic for linear assignment interdiction
- Network deployment of radiation detectors with physics-based detection probability calculations
- On robust maximum flow with polyhedral uncertainty sets
- The maximum flow problem of uncertain network
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- Partitioning procedures for solving mixed-variables programming problems
- Robust solutions of uncertain linear programs
- Robust discrete optimization and network flows
- The Benders decomposition algorithm: a literature review
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Robust flows over time: models and complexity results
- Deterministic network interdiction
- Robust optimization-methodology and applications
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The stochastic interdiction median problem with disruption intensity levels
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach
- Online peer-to-peer lending platform and supply chain finance decisions and strategies
- Network interdiction with asymmetric cost uncertainty
- Recent advances in robust optimization: an overview
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- A survey of network interdiction models and algorithms
- 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
- An approach to the distributionally robust shortest path problem
- Integer programming methods for solving binary interdiction games
- Solving the bi-objective maximum-flow network-interdiction problem
- Theory and Applications of Robust Optimization
- Minimizing a stochastic maximum-reliability path
- A Brief Overview of Interdiction and Robust Optimization
- The Price of Robustness
- A new approach to the maximum-flow problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Securing a border under asymmetric information
- Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
- Sequential Shortest Path Interdiction with Incomplete Information
- Shortest-path network interdiction
- Sequential Interdiction with Incomplete Information and Learning
- Multilevel Approaches for the Critical Node Problem
- Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Robust and Adaptive Network Flows
- Modelling Some Robust Design Problems via Conic Optimization
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- The Value of Randomized Strategies in Distributionally Robust Risk-Averse Network Interdiction Problems
- Multi-Period Max Flow Network Interdiction with Restructuring for Disrupting Domestic Sex Trafficking Networks
- Shortest path network interdiction with incomplete information: a robust optimization approach
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)