Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance
DOI10.2298/YJOR150624009TzbMATH Open1474.90387OpenAlexW2409198285MaRDI QIDQ4987673FDOQ4987673
Authors: Javad Tayyebi, Massoud Aman 
Publication date: 3 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/yjor150624009t
Recommendations
- Computation of the reverse shortest-path problem
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
- Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
- Algorithms for the shortest path improvement problems under unit Hamming distance
- Inverse constrained minimum spanning tree problem under Hamming distance
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse Optimization
- On an instance of the inverse shortest paths problem
- Note on ``Inverse minimum cost flow problems under the weighted Hamming distance
- Some inverse optimization problems under the Hamming distance
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- An inverse problem of the weighted shortest path problem
- Title not available (Why is that?)
- A column generation method for inverse shortest path problems
- Computation of the reverse shortest-path problem
- The shortest path improvement problems under Hamming distance
- On dual minimum cost flow algorithms
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance
- A network flow method for solving some inverse combinatorial optimization problems
- Algorithms for the shortest path improvement problems under unit Hamming distance
- Complexity of some inverse shortest path lengths problems
Cited In (8)
- Further study on reverse 1-center problem on trees
- Title not available (Why is that?)
- Expanding maximum capacity path under weighted sum-type distances
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
- Computation of the reverse shortest-path problem
- Reverse maximum flow problem under the weighted Chebyshev distance
This page was built for publication: Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987673)
