Author of the publication

New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels.

, and . Comput. Optim. Appl., 43 (3): 437-448 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows., , and . Eur. J. Oper. Res., 196 (1): 140-154 (2009)A new strategy for the undirected two-commodity maximum flow problem., , and . Comput. Optim. Appl., 47 (2): 289-305 (2010)An algorithm for the biobjective integer minimum cost flow problem., and . Comput. Oper. Res., 28 (2): 139-156 (2001)An efficient label setting/correcting shortest path algorithm., and . Comput. Optim. Appl., 51 (1): 437-455 (2012)A generalization of the scaling max-flow algorithm., , and . Comput. Oper. Res., 31 (13): 2183-2198 (2004)The biobjective minimum cost flow problem., and . Eur. J. Oper. Res., 124 (3): 591-600 (2000)Shortest Path Simplex Algorithm with a Multiple Pivot Rule: a Comparative Study., and . Asia Pac. J. Oper. Res., 27 (6): 677-691 (2010)On the second point-to-point undirected shortest simple path problem., and . Optim. Lett., 7 (8): 1875-1881 (2013)The biobjective undirected two-commodity minimum cost flow problem., , and . Eur. J. Oper. Res., 164 (1): 89-103 (2005)New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels., and . Comput. Optim. Appl., 43 (3): 437-448 (2009)