IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v234y2014i3p916-920.html
   My bibliography  Save this article

Note on “Inverse minimum cost flow problems under the weighted Hamming distance”

Author

Listed:
  • Tayyebi, Javad
  • Aman, Massoud

Abstract

Jiang et al. proposed an algorithm to solve the inverse minimum cost flow problems under the bottleneck-type weighted Hamming distance [Y. Jiang, L. Liu, B. Wuc, E. Yao, Inverse minimum cost flow problems under the weighted Hamming distance, European Journal of Operational Research 207 (2010) 50–54]. In this note, it is shown that their proposed algorithm does not solve correctly the inverse problem in the general case due to some incorrect results in that article. Then, a new algorithm is proposed to solve the inverse problem in strongly polynomial time. The algorithm uses the linear search technique and solves a shortest path problem in each iteration.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:234:y:2014:i:3:p:916-920
    DOI: 10.1016/j.ejor.2013.11.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713009132
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.11.014?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.
    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. Souza, J.W.G. & Pereira, H.B.B. & Santos, A.A.B. & Senna, V. & Moret, M.A., 2014. "A new proposal for analyzing combustion process stability based on the Hamming distance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 413(C), pages 301-306.
    2. 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.

    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:eee:ejores:v:234:y:2014:i:3:p:916-920. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.