A least-squares minimum-cost network flow algorithm (Q646641): Difference between revisions

@@ Property / author @@
+Earl R. Barnes
@@ Property / author: Earl R. Barnes / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+PDNET
@@ Property / describes a project that uses: PDNET / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MCFClass
@@ Property / describes a project that uses: MCFClass / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+RelaxIV
@@ Property / describes a project that uses: RelaxIV / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+RELAX4
@@ Property / describes a project that uses: RELAX4 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+NETGEN
@@ Property / describes a project that uses: NETGEN / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10479-011-0858-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2003615171
@@ Property / OpenAlex ID: W2003615171 / rank @@
+Normal rank
@@ Property / cites work @@
+A least-squares primal-dual algorithm for solving linear programming problems
+Normal rank
@@ Property / cites work @@
+Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Potential function methods for approximately solving linear programming problems: theory and practice.
+Normal rank
@@ Property / cites work @@
+Q3323698
@@ Property / cites work: Q3323698 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Properties of the Network Simplex Method
+Normal rank
@@ Property / cites work @@
+Benchmarking optimization software with performance profiles.
+Normal rank
@@ Property / cites work @@
+A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
+Normal rank
@@ Property / cites work @@
+An exterior simplex type algorithm for the minimum cost network flow problem
+Normal rank
@@ Property / cites work @@
+Q4283440
@@ Property / cites work: Q4283440 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient implementation of the network simplex method
+Normal rank
@@ Property / cites work @@
+Q3968758
@@ Property / cites work: Q3968758 / rank @@
+Normal rank
@@ Property / cites work @@
+NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
+Normal rank
@@ Property / cites work @@
+Q4879581
@@ Property / cites work: Q4879581 / rank @@
+Normal rank
@@ Property / cites work @@
+A strictly improving linear programming Phase I algorithm
+Normal rank
@@ Property / cites work @@
+A Faster Strongly Polynomial Minimum Cost Flow Algorithm
+Normal rank
@@ Property / cites work @@
+A polynomial time primal network simplex algorithm for minimum cost flows
+Normal rank
@@ Property / cites work @@
+Q4953319
@@ Property / cites work: Q4953319 / rank @@
+Normal rank
@@ Property / cites work @@
+Fortran subroutines for network flow optimization using an interior point algorithm
+Normal rank
@@ Property / cites work @@
+A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy
+Normal rank
@@ Property / cites work @@
+Q4283454
@@ Property / cites work: Q4283454 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A strongly polynomial minimum cost circulation algorithm
+Normal rank
@@ Property / cites work @@
+A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
+Normal rank
@@ Property / cites work @@
+A polynomial combinatorial algorithm for generalized minimum cost flow
+Normal rank