A least-squares minimum-cost network flow algorithm
From MaRDI portal
Publication:646641
Recommendations
Cites work
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 3791941 (Why is no real title available?)
- scientific article; zbMATH DE number 515928 (Why is no real title available?)
- scientific article; zbMATH DE number 515938 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A computational study of cost reoptimization for min-cost flow problems
- A least-squares primal-dual algorithm for solving linear programming problems
- A polynomial combinatorial algorithm for generalized minimum cost flow
- A polynomial time primal network simplex algorithm for minimum cost flows
- A strictly improving linear programming Phase I algorithm
- A strongly polynomial minimum cost circulation algorithm
- An efficient implementation of the network simplex method
- An exterior simplex type algorithm for the minimum cost network flow problem
- Benchmarking optimization software with performance profiles.
- Experimental and Efficient Algorithms
- 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
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- Theoretical Properties of the Network Simplex Method
Cited in
(7)- GNU Oflox: an academic software for the minimal cost network flow problem
- scientific article; zbMATH DE number 5173820 (Why is no real title available?)
- A least-squares primal-dual algorithm for solving linear programming problems
- scientific article; zbMATH DE number 795215 (Why is no real title available?)
- An algorithm for the minimum variance point of a network
- ON SOLVING SHORTEST PATHS WITH A LEAST-SQUARES PRIMAL-DUAL ALGORITHM
- An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
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)
