A least-squares minimum-cost network flow algorithm
From MaRDI portal
Publication:646641
DOI10.1007/s10479-011-0858-7zbMath1225.90014MaRDI QIDQ646641
Ellis L. Johnson, Joel S. Sokol, Balaji Gopalakrishnan, Seunghyun Kong, Earl R. Barnes
Publication date: 17 November 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0858-7
Related Items
Uses Software
Cites Work
- An exterior simplex type algorithm for the minimum cost network flow problem
- A strongly polynomial minimum cost circulation algorithm
- A strictly improving linear programming Phase I algorithm
- A polynomial time primal network simplex algorithm for minimum cost flows
- Potential function methods for approximately solving linear programming problems: theory and practice.
- A least-squares primal-dual algorithm for solving linear programming problems
- A polynomial combinatorial algorithm for generalized minimum cost flow
- A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy
- An efficient implementation of the network simplex method
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Theoretical Properties of the Network Simplex Method
- Fortran subroutines for network flow optimization using an interior point algorithm
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Experimental and Efficient Algorithms
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
