The continuous maximum capacity path interdiction problem

DOI10.1016/j.ejor.2022.05.028OpenAlexW4280488260MaRDI QIDQ2083925

Yanyan Li

Publication date: 17 October 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.05.028

zbMATH Keywords

Newton's methodnetworksStackelberg gamesnetwork interdictionmaximum capacity pathinterdiction games

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• Matching interdiction
• A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
• The multi-terminal maximum-flow network-interdiction problem
• Hub interdiction problem variants: models and metaheuristic solution algorithms
• A linear time algorithm for the maximum capacity path problem
• The \(k\)-splittable flow problem
• Internet packet routing: application of a \(K\)-quickest path algorithm
• An algorithm for the quickest path problem
• Robust discrete optimization and network flows
• Adaptive packet routing for bursty adversarial traffic
• Protection of flows under targeted attacks
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
• On the use of intersection cuts for bilevel optimization
• Deterministic network interdiction
• Finding the most vital arcs in a network
• Solving bilevel programs with the KKT-approach
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• A survey of network interdiction models and algorithms
• Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
• Emergence of Scaling in Random Networks
• Minimizing a stochastic maximum-reliability path
• Shortest path network interdiction with asymmetric information
• The Price of Robustness
• Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations
• WEIGHTED MINIMAX REAL-VALUED FLOWS
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Maximizing the minimum source-sink path subject to a budget constraint
• A problem in network interdiction
• A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
• Exact algorithms and bounds for the dynamic assignment interdiction problem
• Dynamic shortest‐path interdiction
• Robust constrained shortest path problems under budgeted uncertainty
• Sequential Shortest Path Interdiction with Incomplete Information
• Shortest-path network interdiction
• Two-Person Zero-Sum Games for Network Interdiction
• Increasing the Weight of Minimum Spanning Trees
• Maximum Capacity Path Interdiction Problem with Fixed Costs
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Optimal interdiction policy for a flow network
• Optimal interdiction of a supply network

This page was built for publication: The continuous maximum capacity path interdiction problem