Efficient algorithms for the reverse shortest path problem on trees under the hamming distance
From MaRDI portal
Publication:4987673
DOI10.2298/YJOR150624009TzbMath1474.90387OpenAlexW2409198285MaRDI QIDQ4987673
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
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Expanding maximum capacity path under weighted sum-type distances ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ Further Study on Reverse 1-Center Problem on Trees ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs
Cites Work
- Unnamed Item
- Unnamed Item
- On an instance of the inverse shortest paths problem
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- On dual minimum cost flow algorithms
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance
- Algorithms for the shortest path improvement problems under unit Hamming distance
- Computation of the reverse shortest-path problem
- Inverse combinatorial optimization: a survey on problems, methods, and results
- An inverse problem of the weighted shortest path problem
- The shortest path improvement problems under Hamming distance
- Note on ``Inverse minimum cost flow problems under the weighted Hamming distance
- Some inverse optimization problems under the Hamming distance
- Complexity of some inverse shortest path lengths problems
- Inverse Optimization
- A column generation method for inverse shortest path problems
- A network flow method for solving some inverse combinatorial optimization problems
This page was built for publication: Efficient algorithms for the reverse shortest path problem on trees under the hamming distance
