Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

DOI10.1002/NAV.21839MaRDI QIDQ5226166zbMATH OpenOpenAlexWikidataFDO

Authors Tim Holzmann, J. Cole Smith

Publication date 30 July 2019

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.21839

zbMATH Keywords

dynamic programminginterdictionmixed integer programmingmultiobjective optimization

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Dynamic programming (90C39) Cooperative games (91A12)

Recommendations

• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
• Shortest-path network interdiction
• Risk-averse shortest path interdiction
• Dynamic shortest-path interdiction
• Network interdiction with asymmetric cost uncertainty

Cited in

(9)

• A decomposition approach for stochastic shortest-path network interdiction with goal threshold
• Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
• Exact solution approaches for a class of bilevel fractional programs
• A brief overview of interdiction and robust optimization
• On universal and multiobjective model extensions for combinatorial optimization problems
• Interdicting restructuring networks with applications in illicit trafficking
• Shortest path network interdiction with asymmetric uncertainty
• Fighting terrorism: how to position rapid response teams?
• An exact method for trilevel hub location problem with interdiction

This page was built for publication: Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226166)