Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
From MaRDI portal
Publication:2230789
DOI10.1007/s11590-020-01687-9zbMath1477.90120OpenAlexW3120574611MaRDI QIDQ2230789
Panos M. Pardalos, Qiao Zhang, Xiucui Guan, Hui Wang
Publication date: 28 September 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01687-9
treeshortest pathHamming distancedynamic programming algorithmnetwork interdiction problemupgrading critical edges
Related Items (4)
The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees ⋮ Exact solution approaches for a class of bilevel fractional programs ⋮ The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees ⋮ An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching interdiction
- On short paths interdiction problems: Total and node-wise limited interdiction
- Network flow interdiction on planar graphs
- Blockers and transversals
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Most vital links and nodes in weighted networks
- Efficient algorithms for finding the most vital edge of a minimum spanning tree
- A faster computation of the most vital edge of a shortest path
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Optimal shortest path set problem in undirected graphs
- Critical edges for the assignment problem: complexity and exact resolution
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- Algorithms and Computation
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
This page was built for publication: Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
