5 papers
Maximum Shortest Path Interdiction Problem by Upgrading Nodes on Trees under Unit Cost
Qiao Zhang, Xiao Li, Xiucui Guan +1
Network interdiction problems by deleting critical nodes have wide applications. However, node deletion is not always feasible in certain practical scenarios. We consider the maxim…
The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
Qiao Zhang, Xiao Li, Xiucui Guan
We consider the Restricted Inverse Optimal Value Problem (RIOVSP) on trees under weighted bottleneck Hamming distance, denoted as (RIOVSPT). The problem aims to minimize the…
Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges
Xiao Li, Xiucui Guan, Junhua Jia +1
The double interdiction problem on trees (DIT) for the sum of root-leaf distances (SRD) has significant implications in diverse areas such as transportation networks, military stra…
Restricted inverse optimal value problem on linear programming under weighted norm
Junhua Jia, Xiucui Guan, Xinqiang Qian +1
We study the restricted inverse optimal value problem on linear programming under weighted norm (RIOVLP ). Given a linear programming problem $LP_c: \min \{cx|Ax=b,x\geq…
The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees
Xiao Li, Xiucui Guan, Qiao Zhang +2
A network for the transportation of supplies can be described as a rooted tree with a weight of a degree of congestion for each edge. We take the sum of root-leaf distance (SRD) on…