A least-squares minimum-cost network flow algorithm
type: Item
instance of: scholarly article
title: A least-squares minimum-cost network flow algorithm
zbMATH Open document ID: 1225.90014
author: Balaji Gopalakrishnan
author: Seunghyun Kong
author: Ellis L. Johnson
author: Joel Sokol
author: Earl R. Barnes
published in: Annals of Operations Research
publication date: 2011-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 5973823
zbMATH Keywords: network flow
zbMATH Keywords: least-squares
zbMATH Keywords: primal-dual
describes a project that uses: DIMACS
describes a project that uses: CPLEX
describes a project that uses: PDNET
describes a project that uses: MCFClass
describes a project that uses: RelaxIV
describes a project that uses: RELAX4
describes a project that uses: NETGEN
MaRDI profile type: Publication
full work available at URL: s10479-011-0858-7
OpenAlex ID: W2003615171
cites work: A least-squares primal-dual algorithm for solving linear programming problems
cites work: Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
cites work: Potential function methods for approximately solving linear programming problems: theory and practice.
cites work: Q3323698
cites work: Theoretical Properties of the Network Simplex Method
cites work: Benchmarking optimization software with performance profiles.
cites work: A computational study of cost reoptimization for min-cost flow problems
cites work: An exterior simplex type algorithm for the minimum cost network flow problem
cites work: Q4283440
cites work: An efficient implementation of the network simplex method
cites work: Q3968758
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Q4879581
cites work: A strictly improving linear programming Phase I algorithm
cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
cites work: A polynomial time primal network simplex algorithm for minimum cost flows
cites work: Q4953319
cites work: Fortran subroutines for network flow optimization using an interior point algorithm
cites work: A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy
cites work: Q4283454
cites work: Experimental and Efficient Algorithms
cites work: A strongly polynomial minimum cost circulation algorithm
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: A polynomial combinatorial algorithm for generalized minimum cost flow
DOI: 10.1007/S10479-011-0858-7
description: scientific article; zbMATH DE number 5973823