The cost scaling algorithm for bipartite networks

MaRDI QIDQ3054979zbMATH OpenFDO

Authors Laura Ciupală

Publication date 5 November 2010

zbMATH Keywords

bipartite networkminimum cost flownetwork flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of mathematical programming (90C90)

Recommendations

• Improved Algorithms for Bipartite Network Flow
• Minimum cost flows in graphs with unit capacities
• Minimum-cost flows in unit-capacity networks
• Finding minimum-cost flows by double scaling
• Fast Algorithms for Bipartite Network Flow

Cited in

(3)

• Minimum cost flows in graphs with unit capacities
• Improved Algorithms for Bipartite Network Flow
• Global Price Updates Help

This page was built for publication: The cost scaling algorithm for bipartite networks

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