Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption

DOI10.1007/S10479-023-05812-6zbMATH Open1547.90216WikidataQ129964837 ScholiaQ129964837MaRDI QIDQ6547016FDOQ6547016

Authors: Darshan Chauhan, Avinash Unnikrishnan, Stephen D. Boyles, Priyadarshan N. Patil 

Publication date: 30 May 2024

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

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

zbMATH Keywords

uncertaintyrobust optimizationmaximum flowBenders' decompositionLagrangian relaxationnetwork interdiction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Robustness in mathematical programming (90C17)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Partitioning procedures for solving mixed-variables programming problems
• Recent advances in robust optimization: an overview
• Theory and applications of robust optimization
• Robust optimization
• The Price of Robustness
• Robust solutions of uncertain linear programs
• Robust discrete optimization and network flows
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The stochastic interdiction median problem with disruption intensity levels
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• Deterministic network interdiction
• Robust optimization-methodology and applications
• A new approach to the maximum-flow problem
• Exact solution of the robust knapsack problem
• Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
• Evader interdiction: algorithms, complexity and collateral damage
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• Minimizing a stochastic maximum-reliability path
• Title not available (Why is that?)
• Shortest-path network interdiction
• Solving the bi-objective maximum-flow network-interdiction problem
• Securing a border under asymmetric information
• Title not available (Why is that?)
• Network deployment of radiation detectors with physics-based detection probability calculations
• Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
• The maximum flow problem of uncertain network
• A simple greedy heuristic for linear assignment interdiction
• Modelling some robust design problems via conic optimization
• Network interdiction with asymmetric cost uncertainty
• On robust maximum flow with polyhedral uncertainty sets
• 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
• The Benders decomposition algorithm: a literature review
• Robust and adaptive network flows
• Interdiction Games and Monotonicity, with Application to Knapsack Problems
• New solution approaches for the maximum-reliability stochastic network interdiction problem
• Sequential Shortest Path Interdiction with Incomplete Information
• Sequential interdiction with incomplete information and learning
• Robust flows over time: models and complexity results
• An approach to the distributionally robust shortest path problem
• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
• A survey of network interdiction models and algorithms
• Multilevel approaches for the critical node problem
• Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach
• Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics
• Online peer-to-peer lending platform and supply chain finance decisions and strategies
• Integer programming methods for solving binary interdiction games
• A brief overview of interdiction and robust optimization
• 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

Cited In (2)

• Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory
• Two-stage nodal network interdiction under decision-dependent uncertainty

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)