Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
type: Item
instance of: scholarly article
title: Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
zbMATH Open document ID: 1466.90119
author: Qiao Zhang
author: Xiucui Guan
author: Panos M. Pardalos
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7340882
zbMATH Keywords: network interdiction problem
zbMATH Keywords: upgrading critical edges
zbMATH Keywords: shortest path
zbMATH Keywords: weighted \(l_1\) norm
zbMATH Keywords: primal dual algorithm
zbMATH Keywords: minimum cost cut
MaRDI profile type: Publication
full work available at URL: s10898-020-00958-0
OpenAlex ID: W3092645907
cites work: A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
cites work: Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
cites work: Critical edges for the assignment problem: complexity and exact resolution
cites work: Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
cites work: Most vital links and nodes in weighted networks
cites work: Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
cites work: Q4875228
cites work: Edge Weight Reduction Problems in Directed Acyclic Graphs
cites work: Efficient algorithms for finding the most vital edge of a minimum spanning tree
cites work: On short paths interdiction problems: Total and node-wise limited interdiction
cites work: Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
cites work: A faster computation of the most vital edge of a shortest path
cites work: Q4739657
cites work: Algorithms and Computation
cites work: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
cites work: Matching interdiction
cites work: Network flow interdiction on planar graphs
cites work: Blockers and transversals
cites work: Optimal shortest path set problem in undirected graphs
DOI: 10.1007/S10898-020-00958-0
description: scientific article; zbMATH DE number 7340882