IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v178y2018i2d10.1007_s10957-018-1221-9.html
   My bibliography  Save this article

An Algorithm for Solving the Shortest Path Improvement Problem on Rooted Trees Under Unit Hamming Distance

Author

Listed:
  • Binwu Zhang

    (Hohai University)

  • Xiucui Guan

    (Southeast University)

  • Panos M. Pardalos

    (University of Florida
    Higher School of Economics)

  • Chunyuan He

    (Hohai University)

Abstract

Shortest path problems play important roles in computer science, communication networks, and transportation networks. In a shortest path improvement problem under unit Hamming distance, an edge-weighted graph with a set of source–terminal pairs is given. The objective is to modify the weights of the edges at a minimum cost under unit Hamming distance such that the modified distances of the shortest paths between some given sources and terminals are upper bounded by the given values. As the shortest path improvement problem is NP-hard, it is meaningful to analyze the complexity of the shortest path improvement problem defined on rooted trees with one common source. We first present a preprocessing algorithm to normalize the problem. We then present the proofs of some properties of the optimal solutions to the problem. A dynamic programming algorithm is proposed for the problem, and its time complexity is analyzed. A comparison of the computational experiments of the dynamic programming algorithm and MATLAB functions shows that the algorithm is efficient although its worst-case complexity is exponential time.

Suggested Citation

  • Binwu Zhang & Xiucui Guan & Panos M. Pardalos & Chunyuan He, 2018. "An Algorithm for Solving the Shortest Path Improvement Problem on Rooted Trees Under Unit Hamming Distance," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 538-559, August.
    • Handle: RePEc:spr:joptap:v:178:y:2018:i:2:d:10.1007_s10957-018-1221-9
    DOI: 10.1007/s10957-018-1221-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-018-1221-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-018-1221-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jiang, Yiwei & Liu, Longcheng & Wu, Biao & Yao, Enyu, 2010. "Inverse minimum cost flow problems under the weighted Hamming distance," European Journal of Operational Research, Elsevier, vol. 207(1), pages 50-54, November.
    2. Xiucui Guan & Binwu Zhang, 2012. "Inverse 1-median problem on trees under weighted Hamming distance," Journal of Global Optimization, Springer, vol. 54(1), pages 75-82, September.
    3. Binwu Zhang & Jianzhong Zhang & Yong He, 2005. "The Center Location Improvement Problem Under the Hamming Distance," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 187-198, March.
    4. Xiucui Guan & Xinyan He & Panos M. Pardalos & Binwu Zhang, 2017. "Inverse max $$+$$ + sum spanning tree problem under Hamming distance by modifying the sum-cost vector," Journal of Global Optimization, Springer, vol. 69(4), pages 911-925, December.
    5. Yong He & Binwu Zhang & Enyu Yao, 2005. "Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance," Journal of Combinatorial Optimization, Springer, vol. 9(1), pages 91-100, February.
    6. Duin, C.W. & Volgenant, A., 2006. "Some inverse optimization problems under the Hamming distance," European Journal of Operational Research, Elsevier, vol. 170(3), pages 887-899, May.
    7. Binwu Zhang & Jianzhong Zhang & Liqun Qi, 2006. "The shortest path improvement problems under Hamming distance," Journal of Combinatorial Optimization, Springer, vol. 12(4), pages 351-361, December.
    8. Clemens Heuberger, 2004. "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 329-361, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xianyue Li & Xichao Shu & Huijing Huang & Jingjing Bai, 2019. "Capacitated partial inverse maximum spanning tree under the weighted Hamming distance," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1005-1018, November.
    2. Longcheng Liu & Jianzhong Zhang, 2006. "Inverse maximum flow problems under the weighted Hamming distance," Journal of Combinatorial Optimization, Springer, vol. 12(4), pages 395-408, December.
    3. Junhua Jia & Xiucui Guan & Qiao Zhang & Xinqiang Qian & Panos M. Pardalos, 2022. "Inverse max+sum spanning tree problem under weighted $$l_{\infty }$$ l ∞ norm by modifying max-weight vector," Journal of Global Optimization, Springer, vol. 84(3), pages 715-738, November.
    4. Xiucui Guan & Xinyan He & Panos M. Pardalos & Binwu Zhang, 2017. "Inverse max $$+$$ + sum spanning tree problem under Hamming distance by modifying the sum-cost vector," Journal of Global Optimization, Springer, vol. 69(4), pages 911-925, December.
    5. Jiang, Yiwei & Liu, Longcheng & Wu, Biao & Yao, Enyu, 2010. "Inverse minimum cost flow problems under the weighted Hamming distance," European Journal of Operational Research, Elsevier, vol. 207(1), pages 50-54, November.
    6. Longcheng Liu & Enyu Yao, 2013. "Weighted inverse maximum perfect matching problems under the Hamming distance," Journal of Global Optimization, Springer, vol. 55(3), pages 549-557, March.
    7. Xianyue Li & Ruowang Yang & Heping Zhang & Zhao Zhang, 2022. "Partial inverse maximum spanning tree problem under the Chebyshev norm," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3331-3350, December.
    8. Xinqiang Qian & Xiucui Guan & Junhua Jia & Qiao Zhang & Panos M. Pardalos, 2023. "Vertex quickest 1-center location problem on trees and its inverse problem under weighted $$l_\infty $$ l ∞ norm," Journal of Global Optimization, Springer, vol. 85(2), pages 461-485, February.
    9. Binwu Zhang & Jianzhong Zhang & Liqun Qi, 2006. "The shortest path improvement problems under Hamming distance," Journal of Combinatorial Optimization, Springer, vol. 12(4), pages 351-361, December.
    10. Javad Tayyebi & Ali Reza Sepasian, 2020. "Partial inverse min–max spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1075-1091, November.
    11. Xianyue Li & Zhao Zhang & Ruowang Yang & Heping Zhang & Ding-Zhu Du, 2020. "Approximation algorithms for capacitated partial inverse maximum spanning tree problem," Journal of Global Optimization, Springer, vol. 77(2), pages 319-340, June.
    12. Hui Wang & Xiucui Guan & Qiao Zhang & Binwu Zhang, 2021. "Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 861-887, May.
    13. Xiucui Guan & Panos Pardalos & Xia Zuo, 2015. "Inverse Max + Sum spanning tree problem by modifying the sum-cost vector under weighted $$l_\infty $$ l ∞ Norm," Journal of Global Optimization, Springer, vol. 61(1), pages 165-182, January.
    14. Nguyen, Kien Trung & Chassein, André, 2015. "The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance," European Journal of Operational Research, Elsevier, vol. 247(3), pages 774-781.
    15. Binwu Zhang & Xiucui Guan & Panos M. Pardalos & Hui Wang & Qiao Zhang & Yan Liu & Shuyi Chen, 2021. "The lower bounded inverse optimal value problem on minimum spanning tree under unit $$l_{\infty }$$ l ∞ norm," Journal of Global Optimization, Springer, vol. 79(3), pages 757-777, March.
    16. Libura, Marek, 2007. "On the adjustment problem for linear programs," European Journal of Operational Research, Elsevier, vol. 183(1), pages 125-134, November.
    17. Tayyebi, Javad & Aman, Massoud, 2014. "Note on “Inverse minimum cost flow problems under the weighted Hamming distance”," European Journal of Operational Research, Elsevier, vol. 234(3), pages 916-920.
    18. Qin Wang & Tianyu Yang & Longshu Wu, 0. "General restricted inverse assignment problems under $$l_1$$l1 and $$l_\infty $$l∞ norms," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.
    19. Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.
    20. Burkard, Rainer E. & Galavii, Mohammadreza & Gassner, Elisabeth, 2010. "The inverse Fermat-Weber problem," European Journal of Operational Research, Elsevier, vol. 206(1), pages 11-17, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:178:y:2018:i:2:d:10.1007_s10957-018-1221-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.