IDEAS home Printed from https://ideas.repec.org/a/igg/joris0/v1y2010i1p73-85.html
   My bibliography  Save this article

A Note on the Connection Between the Primal-Dual and the A* Algorithm

Author

Listed:
  • Xugang Ye

    (Johns Hopkins University, USA)

  • Shih-Ping Han

    (Johns Hopkins University, USA)

  • Anhua Lin

    (Middle Tennessee State University, USA)

Abstract

The primal-dual algorithm for linear programming is very effective for solving network flow problems. For the method to work, an initial feasible solution to the dual is required. In this article, we show that, for the shortest path problem in a positively weighted graph equipped with a consistent heuristic function, the primal-dual algorithm will become the well-known A* algorithm if a special initial feasible solution to the dual is chosen. We also show how the improvements of the dual objective are related to the A* iterations.

Suggested Citation

  • Xugang Ye & Shih-Ping Han & Anhua Lin, 2010. "A Note on the Connection Between the Primal-Dual and the A* Algorithm," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 1(1), pages 73-85, January.
    • Handle: RePEc:igg:joris0:v:1:y:2010:i:1:p:73-85
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/joris.2010101305
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. P. Senthil Kumar, 2018. "Linear Programming Approach for Solving Balanced and Unbalanced Intuitionistic Fuzzy Transportation Problems," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 9(2), pages 73-100, April.

    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:igg:joris0:v:1:y:2010:i:1:p:73-85. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.