GNU Oflox: an academic software for the minimal cost network flow problem
zbMATH Open1398.90006MaRDI QIDQ1653929FDOQ1653929
Authors: A. M. Sajo-Castelli, B. Feijó
Publication date: 7 August 2018
Published in: Bulletin of Computational Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://drive.google.com/open?id=0B5GyVVQ6O030LVJqQnZuRzZRVDA
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
Numerical optimization and variational techniques (65K10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
Cited In (1)
Uses Software
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)