scientific article; zbMATH DE number 29758

MaRDI QIDQ3984907zbMATH OpenFDO

Authors Xuanxi Ning

Publication date 27 June 1992

zbMATH Keywords

minimum cost flowmixed labelling algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 150473
• A new algorithm for finding the minimum cost flow using the duality principle
• scientific article; zbMATH DE number 5173820
• An O(nm^ 2) time algorithm for solving minimal cost network flow problems

Cited in

(4)

• A new algorithm for finding the minimum cost flow using the duality principle
• A new algorithm for minimum path in a network
• Interactive tool for the successive shortest paths algorithm in solving the minimum cost flow problem
• An algorithm for labeling network flow problems

This page was built for publication:

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