An O(nm^ 2) time algorithm for solving minimal cost network flow problems

zbMATH Open1165.90657MaRDI QIDQ3626409FDOQ3626409

Authors: Hassan Salehi Fathabadi, G. H. Shirdel 

Publication date: 22 May 2009

Recommendations

• scientific article; zbMATH DE number 150473
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• scientific article; zbMATH DE number 1918689
• An O (n ² (m + N log n )log n ) min-cost flow algorithm
• A new strongly polynomial dual network simplex algorithm

zbMATH Keywords

network flowcomplementary slcackness conditionsnode potentials

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (16)

• The fractional minimal cost flow problem on network
• An efficient network flow code for finding all minimum cost \(s-t\) cutsets
• Title not available (Why is that?)
• An \(O(mn)\) algorithm for the 1-maximin problem on a network
• Title not available (Why is that?)
• A minimum cost network flow model for the maximum covering and patrol routing problem
• GNU Oflox: an academic software for the minimal cost network flow problem
• The problem of maximum flow with minimum attainable cost in a network
• Title not available (Why is that?)
• Network simplex algorithm for the bi-criteria minimum cost flow over time problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A deterministic annealing algorithm for the minimum concave cost network flow problem
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
• An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
• Minimum-cost strong network orientation problems: Classification, complexity, and algorithms

This page was built for publication: An \(O(nm^ 2)\) time algorithm for solving minimal cost network flow problems

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