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

DOI10.1002/nav.21839zbMath1418.90056OpenAlexW2932267653WikidataQ128064855 ScholiaQ128064855MaRDI QIDQ5226166

Tim Holzmann, J. Cole Smith

Publication date: 30 July 2019

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

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

zbMATH Keywords

dynamic programmingmultiobjective optimizationmixed integer programminginterdiction

Mathematics Subject Classification ID

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

Related Items (3)

Exact solution approaches for a class of bilevel fractional programs ⋮ Interdicting restructuring networks with applications in illicit trafficking ⋮ Shortest path network interdiction with asymmetric uncertainty

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