A least-squares minimum-cost network flow algorithm
From MaRDI portal
Publication:646641
DOI10.1007/S10479-011-0858-7zbMATH Open1225.90014OpenAlexW2003615171MaRDI QIDQ646641FDOQ646641
Balaji Gopalakrishnan, Earl R. Barnes, Ellis L. Johnson, Seunghyun Kong, Joel Sokol
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
Cites Work
- A computational study of cost reoptimization for min-cost flow problems
- Fortran subroutines for network flow optimization using an interior point algorithm
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Title not available (Why is that?)
- A polynomial time primal network simplex algorithm for minimum cost flows
- A strongly polynomial minimum cost circulation algorithm
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Title not available (Why is that?)
- A strictly improving linear programming Phase I algorithm
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Theoretical Properties of the Network Simplex Method
- Title not available (Why is that?)
- An exterior simplex type algorithm for the minimum cost network flow problem
- Title not available (Why is that?)
- An efficient implementation of the network simplex method
- A least-squares primal-dual algorithm for solving linear programming problems
- A polynomial combinatorial algorithm for generalized minimum cost flow
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy
- Title not available (Why is that?)
- Experimental and Efficient Algorithms
Cited In (6)
- Title not available (Why is that?)
- Title not available (Why is that?)
- GNU Oflox: an academic software for the minimal cost network flow problem
- A least-squares primal-dual algorithm for solving linear programming problems
- An algorithm for the minimum variance point of a network
- An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
Uses Software
This page was built for publication: A least-squares minimum-cost network flow algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646641)
