Shortest path network interdiction with asymmetric uncertainty

DOI10.1002/net.22208MaRDI QIDQ6196902

William E. Hart, John E. Mitchell, Unnamed Author, Unnamed Author, Cynthia A. Phillips

Publication date: 15 March 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

networksuncertainty modellingbilevel programmingrobustness and sensitivity analysisinterdiction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Nonlinear programming (90C30) Deterministic network models in operations research (90B10) Other game-theoretic models (91A40) Semi-infinite programming (90C34) Robustness in mathematical programming (90C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Semiconductor lot allocation using robust optimization
• A survey of adjustable robust optimization
• New solution approaches for the maximum-reliability stochastic network interdiction problem
• The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
• Frameworks and results in distributionally robust optimization
• Complexity of near-optimal robust versions of multilevel optimization problems
• Network interdiction with asymmetric cost uncertainty
• A survey of network interdiction models and algorithms
• A decomposition approach for stochastic shortest-path network interdiction with goal threshold
• Risk-Averse Shortest Path Interdiction
• Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs
• Shortest path network interdiction with asymmetric information
• The Price of Robustness
• Securing a border under asymmetric information
• Shortest-path network interdiction
• Robust and Adaptive Network Flows
• Shortest path interdiction problem with arc improvement recourse: A multiobjective approach
• Robust capacity expansion of network flows
• Pyomo — Optimization Modeling in Python
• Interdicting restructuring networks with applications in illicit trafficking