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

Xugang Ye, Shih-Ping Han and Anhua Lin
Additional contact information
Xugang Ye: Johns Hopkins University, USA
Shih-Ping Han: Johns Hopkins University, USA
Anhua Lin: Middle Tennessee State University, USA

International Journal of Operations Research and Information Systems (IJORIS), 2010, vol. 1, issue 1, 73-85

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.

Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/joris.2010101305 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:joris0:v:1:y:2010:i:1:p:73-85

Access Statistics for this article

International Journal of Operations Research and Information Systems (IJORIS) is currently edited by John Wang

More articles in International Journal of Operations Research and Information Systems (IJORIS) from IGI Global
Bibliographic data for series maintained by Journal Editor ().