Maximum shortest path interdiction problem by upgrading edges on trees under weighted $$l_1$$ l 1 norm

Qiao Zhang, Xiucui Guan () and Panos M. Pardalos
Additional contact information
Qiao Zhang: Southeast University
Xiucui Guan: Southeast University
Panos M. Pardalos: University of Florida

Journal of Global Optimization, 2021, vol. 79, issue 4, No 9, 959-987

Abstract: Abstract Network interdiction problems by deleting critical edges have wide applicatio ns. However, in some practical applications, the goal of deleting edges is difficult to achieve. We consider the maximum shortest path interdiction problem by upgrading edges on trees (MSPIT) under unit/weighted $$l_1$$ l 1 norm. We aim to maximize the the length of the shortest path from the root to all the leaves by increasing the weights of some edges such that the upgrade cost under unit/weighted $$l_1$$ l 1 norm is upper-bounded by a given value. We construct their mathematical models and prove some properties. We propose a revised algorithm for the problem (MSPIT) under unit $$l_1$$ l 1 norm with time complexity O(n), where n is the number of vertices in the tree. We put forward a primal dual algorithm in $$O(n^2)$$ O ( n 2 ) time to solve the problem (MSPIT) under weighted $$l_1$$ l 1 norm, in which a minimum cost cut is found in each iteration. We also solve the problem to minimize the cost to upgrade edges such that the length of the shortest path is lower bounded by a value and present an $$O(n^2)$$ O ( n 2 ) algorithm. Finally, we perform some numerical experiments to compare the results obtained by these algorithms.

Keywords: Network interdiction problem; Upgrading critical edges; Shortest path; Weighted $$l_1$$ l 1 norm; Primal dual algorithm; Minimum cost cut (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-020-00958-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:79:y:2021:i:4:d:10.1007_s10898-020-00958-0

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-020-00958-0

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().