A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems

1993 ◽  
Vol 27 (2) ◽  
pp. 102-117 ◽  
Author(s):  
Cynthia Barnhart ◽  
Yosef Sheffi
Networks ◽  
2007 ◽  
Vol 51 (2) ◽  
pp. 133-141 ◽  
Author(s):  
Mauricio C. de Souza ◽  
Philippe Mahey ◽  
Bernard Gendron

Author(s):  
Xugang Ye ◽  
Shih-Ping Han ◽  
Anhua Lin

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.


Sign in / Sign up

Export Citation Format

Share Document