IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/847317.html
   My bibliography  Save this article

Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance

Author

Listed:
  • Bingwu Zhang
  • Xiucui Guan
  • Chunyuan He
  • Shuguo Wang

Abstract

In a shortest path improvement problem under unit Hamming distance (denoted by SPIUH), an edge weighted graph with a set of source-terminal pairs is given; we need to modify the lengths of edges by a minimum cost under unit Hamming distance such that the modified distances of the shortest paths are upper bounded by given values. The SPIUH problem on arborescent network is formulated as a 0-1 integer programming model. Some strongly polynomial time algorithms are designed for the problems on some special arborescent networks. Firstly, two greedy algorithms are proposed for problems on chain networks and special star-tree networks, respectively. Secondly, a strongly polynomial time algorithm is presented for the problem with a single source and constrained paths. Finally, a heuristic algorithm and its computational experiments are given for the SPIUH problem on general graphs.

Suggested Citation

  • Bingwu Zhang & Xiucui Guan & Chunyuan He & Shuguo Wang, 2013. "Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-8, September.
    • Handle: RePEc:hin:jnljam:847317
    DOI: 10.1155/2013/847317
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2013/847317.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/JAM/2013/847317.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/847317?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnljam:847317. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.