...
机译:通过在加权L_1规范下升级树木上的边缘升级最大最短路径互联问题
Southeast Univ Sch Math Nanjing 210096 Peoples R China;
Southeast Univ Sch Math Nanjing 210096 Peoples R China;
Univ Florida Dept Ind & Syst Engn Ctr Appl Optimizat Gainesville FL 32611 USA|Higher Sch Econ LATNA Moscow Russia;
Network interdiction problem; Upgrading critical edges; Shortest path; Weighted l(1) norm; Primal dual algorithm; Minimum cost cut;