The quickest root-leaf interdiction problem on tree networks

DOI10.1016/J.DAM.2025.02.020MaRDI QIDQ6995828zbMATH OpenFDO

Authors Huong Nguyen-Thu, Javad Tayyebi, Kien Trung Nguyen, Nguyen Thanh Luan

Publication date 17 April 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.02.020

zbMATH Keywords

Hamming distanceinterdiction problemquickest pathtree

Mathematics Subject Classification ID

Graph theory (05Cxx) Operations research and management science (90Bxx) Mathematical programming (90Cxx)

Cites work

• A comprehensive survey on the quickest path problem
• A label-setting algorithm for finding a quickest path
• A linear time algorithm for the maximum capacity path problem
• A note on two problems in connexion with graphs
• A problem in network interdiction
• A survey of network interdiction models and algorithms
• Algorithms for the quickest path problem and the reliable quickest path problem
• An algorithm for the quickest path problem
• An implicit enumeration algorithm for the hub interdiction median problem with fortification
• Complexity of determining the most vital elements for the p-median and p-center location problems
• Deterministic network interdiction
• Fast and fine quickest path algorithm
• scientific article; zbMATH DE number 1714716 (Why is no real title available?)
• scientific article; zbMATH DE number 3438629 (Why is no real title available?)
• scientific article; zbMATH DE number 757682 (Why is no real title available?)
• Increasing the Weight of Minimum Spanning Trees
• Interdicting facilities in tree networks
• Maximum Capacity Path Interdiction Problem with Fixed Costs
• Optimal interdiction of a supply network
• Shortest-path network interdiction
• The continuous maximum capacity path interdiction problem
• The k most vital arcs in the shortest path problem
• The most vital edges in the minimum spanning tree problem
• The quickest path problem
• The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees
• Towards strong duality in integer programming

This page was built for publication: The quickest root-leaf interdiction problem on tree networks

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