Shortest path interdiction problem with convex piecewise-linear costs
From MaRDI portal
Publication:6080429
DOI10.1007/s40314-023-02445-0OpenAlexW4386863747MaRDI QIDQ6080429
Malihe Niksirat, Hamid Bigdeli, Adrian M. Deaconu, Javad Tayyebi
Publication date: 2 October 2023
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-023-02445-0
Hierarchical games (including Stackelberg games) (91A65) Combinatorial optimization (90C27) Combinatorial games (91A46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Two-person zero-sum games
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- A survey of network interdiction models and algorithms
- A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection
- Shortest path network interdiction with asymmetric information
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- Dynamic shortest‐path interdiction
- Sequential Shortest Path Interdiction with Incomplete Information
- Shortest-path network interdiction
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
- Linear programming. Foundations and extensions
- A survey on mixed-integer programming techniques in bilevel optimization
This page was built for publication: Shortest path interdiction problem with convex piecewise-linear costs
