An O(nm^ 2) time algorithm for solving minimal cost network flow problems
From MaRDI portal
Publication:3626409
Recommendations
Cited in
(17)- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
- The fractional minimal cost flow problem on network
- An efficient network flow code for finding all minimum cost \(s-t\) cutsets
- An \(O(mn)\) algorithm for the 1-maximin problem on a network
- scientific article; zbMATH DE number 828003 (Why is no real title available?)
- scientific article; zbMATH DE number 150473 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3847193 (Why is no real title available?)
- Network simplex algorithm for the bi-criteria minimum cost flow over time problem
- scientific article; zbMATH DE number 5990494 (Why is no real title available?)
- scientific article; zbMATH DE number 4079141 (Why is no real title available?)
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
- A deterministic annealing algorithm for the minimum concave cost network flow problem
- An efficient algorithm for solving minimum cost flow problem with complementarity slack conditions
- An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
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)
