Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
From MaRDI portal
Publication:2022299
DOI10.1007/s10898-020-00958-0zbMath1466.90119OpenAlexW3092645907MaRDI QIDQ2022299
Qiao Zhang, Xiucui Guan, Panos M. Pardalos
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00958-0
shortest pathprimal dual algorithmnetwork interdiction problemminimum cost cutupgrading critical edgesweighted \(l_1\) norm
Related Items (6)
The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees ⋮ Upgrading edges in the maximal covering location problem ⋮ Upgrading edges in the graphical TSP ⋮ Shortest path interdiction problem with convex piecewise-linear costs ⋮ The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees ⋮ Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
Cites Work
- 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
- 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
- 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
- Edge Weight Reduction Problems in Directed Acyclic Graphs
- 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 weighted \(l_1\) norm
