Skip to main navigation
Skip to search
Skip to main content
Experts@Syracuse Home
Help & FAQ
Home
Profiles
Research units
Research output
Equipment
Grants
Activities
Press and Media
Prizes
Search by expertise, name or affiliation
The shortest path interdiction problem with randomized interdiction strategies: complexity and algorithms
Tim Holzmann,
J. Cole Smith
College of Engineering & Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
15
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The shortest path interdiction problem with randomized interdiction strategies: complexity and algorithms'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Shortest Path
100%
Interdiction
100%
Interdiction Problems
100%
Strategy Complexity
100%
Cost Function
20%
Linear Programming
20%
Non-affine
20%
Game over
20%
Cost Increase
20%
Zero-sum Game
20%
General Algorithm
20%
Directed Networks
20%
Expected Cost
20%
Minimum Expected Cost
20%
Strong NP-hardness
20%
Interdict
20%
Affine Function
20%
Minimum Cost Path
20%
Schur Concave
20%
Schur Convex
20%
Computer Science
Linear Programming
100%
Randomly Generated Instance
100%
Directed Network
100%
Affine Function
100%
Minimum Cost Path
100%
Classic Formulation
100%
Mathematics
Probability Theory
100%
Cost Function
100%
Linear Programming
100%
Affine Function
100%
Economics, Econometrics and Finance
Cost Function
100%