Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 221-234
- https://doi.org/10.1007/11753728_24
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff GamesPublished by Springer Nature ,2004
- Finding the most vital arcs in a networkOperations Research Letters, 1989
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Most vital links and nodes in weighted networksOperations Research Letters, 1982
- Positional strategies for mean payoff gamesInternational Journal of Game Theory, 1979
- A problem in network interdictionNaval Research Logistics Quarterly, 1978
- Maximizing the minimum source-sink path subject to a budget constraintMathematical Programming, 1977
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- Optimal interdiction policy for a flow networkNaval Research Logistics Quarterly, 1971
- Maximum-Minimum Sätze über GraphenActa Mathematica Hungarica, 1958