GNU Oflox: an academic software for the minimal cost network flow problem
From MaRDI portal
Publication:1653929
Recommendations
- An \(O(nm^ 2)\) time algorithm for solving minimal cost network flow problems
- A network simplex method for the budget-constrained minimum cost flow problem
- A least-squares minimum-cost network flow algorithm
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Global search algorithms for minimum concave-cost network flow problems
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- The problem of minimum cost flow in undirected networks: optimality conditions and analysis of alternative formulations
- scientific article; zbMATH DE number 795215
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- A polynomial time primal network simplex algorithm for minimum cost flows
Cites work
This page was built for publication: GNU Oflox: an academic software for the minimal cost network flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653929)