GNU Oflox: an academic software for the minimal cost network flow problem
Summary: We present an open-source software package written for GNU Octave. The software is an implementation of the Simplex algorithm for the minimal cost network flow problem oriented towards the academic environment. The implementation supports the use of Big-M and Phase I/Phase II methods and it can also start from a given feasible solution. Flexibility of the package's output configuration provides many attractive possibilities. The outputs are plain editable \LaTeX files that can be modified and orchestrated to fit most academic needs. It can be used in examination materials, homework assignments or even form part of a project. The format used to describe the network is the DIMACS min file format to which a simple extension was added in order to support the description of feasible trees in the file.
- 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
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)
