Computation of the reverse shortest-path problem

DOI10.1023/A:1022429905385zbMath1046.90011OpenAlexW1577976795MaRDI QIDQ1810889

Yanpei Liu, Zhang, Jianzhong

Publication date: 9 June 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022429905385

zbMATH Keywords

networkNP-completenesspolynomial-time algorithms

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (14)

Reverse shortest path problem for unit-disk graphs ⋮ The shortest path improvement problems under Hamming distance ⋮ Reverse shortest path problem in weighted unit-disk graphs ⋮ An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance ⋮ On reverse shortest paths in geometric proximity graphs ⋮ Lower bound sets for biobjective shortest path problems ⋮ The inverse 1-median problem on tree networks with variable real edge lengths ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ Further Study on Reverse 1-Center Problem on Trees ⋮ Outlier respecting points approximation ⋮ A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Efficient algorithms for the reverse shortest path problem on trees under the hamming distance ⋮ Some inverse optimization problems under the Hamming distance

This page was built for publication: Computation of the reverse shortest-path problem