A new algorithm for finding the minimum cost flow using the duality principle

MaRDI QIDQ2886313zbMATH OpenFDO

Authors Deguo Xiong, Yongwen Hu, Jianming Shi

Publication date 1 June 2012

Published in Journal of Shandong University. Natural Science (Search for Journal in Brave)

zbMATH Keywords

minimum cost flowduality principal

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• A new strongly polynomial dual network simplex algorithm
• On dual minimum cost flow algorithms (extended abstract)
• A unified framework for primal-dual methods in minimum cost network flow problems
• scientific article; zbMATH DE number 29758
• A new scaling algorithm for the minimum cost network flow problem

Cited in

(3)

• A new scaling algorithm for the minimum cost network flow problem
• An efficient algorithm for solving minimum cost flow problem with complementarity slack conditions
• On dual minimum cost flow algorithms

This page was built for publication: A new algorithm for finding the minimum cost flow using the duality principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2886313)