Maximum Capacity Path Interdiction Problem with Fixed Costs
From MaRDI portal
Publication:5193217
DOI10.1142/S0217595919500180zbMath1423.90034OpenAlexW2970909133WikidataQ127331623 ScholiaQ127331623MaRDI QIDQ5193217
Javad Tayyebi, Abumoslem Mohammadi
Publication date: 9 September 2019
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595919500180
Related Items
Expanding maximum capacity path under weighted sum-type distances ⋮ Shortest path interdiction problem with convex piecewise-linear costs ⋮ Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance ⋮ The continuous maximum capacity path interdiction problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multi-terminal maximum-flow network-interdiction problem
- A linear time algorithm for the maximum capacity path problem
- On short paths interdiction problems: Total and node-wise limited interdiction
- Network flow interdiction on planar graphs
- The k most vital arcs in the shortest path problem
- The most vital edges in the minimum spanning tree problem
- Robust discrete optimization and its applications
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance
- Protection of flows under targeted attacks
- Deterministic network interdiction
- Computation of the reverse shortest-path problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Solving bilevel programs with the KKT-approach
- Recent advances in robust optimization: an overview
- Stochastic Network Interdiction
- Risk-Averse Shortest Path Interdiction
- Theory and Applications of Robust Optimization
- Shortest path network interdiction with asymmetric information
- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
- Inverse Optimization
- A problem in network interdiction
- Two extended formulations for cardinality maximum flow network interdiction problem
- Dynamic shortest‐path interdiction
- Sequential Shortest Path Interdiction with Incomplete Information
- Shortest-path network interdiction
- Combinatorial algorithms for inverse network flow problems
- Two-Person Zero-Sum Games for Network Interdiction
- Increasing the Weight of Minimum Spanning Trees
- Efficient algorithms for the reverse shortest path problem on trees under the hamming distance
- Improved Algorithms for MST and Metric-TSP Interdiction
- Variations on the Stochastic Shortest Path Problem
- The network inhibition problem
- Inverse Maximum Flow Problems under the Combining Norms
- 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: Maximum Capacity Path Interdiction Problem with Fixed Costs
