ON NETWORK SIMPLEX METHOD USING THE PRIMAL-DUAL SYMMETRIC PIVOTING RULE

スポンサーリンク

概要

• 論文の詳細を見る

• We consider a network simplex method using the primal-dual symmetric pivoting rule proposed by Chen, Pardalos, and Saunders. For minimum-cost network-flow problems, we prove global convergence of the algorithm and propose a new scheme in which the algorithm can start from an arbitrary pair of primal and dual feasible spanning trees. For shortest-path problems, we prove the strongly polynomial time complexity of the algorithm.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Muramatsu Masakazu

  Sophia University

関連論文

• ON NETWORK SIMPLEX METHOD USING THE PRIMAL-DUAL SYMMETRIC PIVOTING RULE

スポンサーリンク