Expanding maximum capacity path under weighted sum-type distances

DOI10.3934/math.2021237OpenAlexW3128083168MaRDI QIDQ2144881

Yanyan Li

Publication date: 17 June 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2021237

zbMATH Keywords

maximum capacity pathreverse optimizationminimum ratio pathSecant-Newton algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The capacity expansion path problem in networks
• A linear time algorithm for the maximum capacity path problem
• Partial inverse min-max spanning tree problem
• Minimum cost-reliability ratio path problem
• Weight reduction problems with certain bottleneck objectives.
• An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
• On inverse linear programming problems under the bottleneck-type weighted Hamming distance
• Inverse optimization in semi-infinite linear programs
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• The shortest path improvement problems under Hamming distance
• Robust inverse optimization
• On the bottleneck capacity expansion problems on networks
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations
• A constrained capacity expansion problem on networks
• Reverse maximum flow problem under the weighted Chebyshev distance
• An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
• Efficient algorithms for the reverse shortest path problem on trees under the hamming distance
• Maximum Capacity Path Interdiction Problem with Fixed Costs
• A class of bottleneck expansion problems
• A capacity expansion problem with budget constraint and bottleneck limitation

This page was built for publication: Expanding maximum capacity path under weighted sum-type distances