Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
type: Item
instance of: scholarly article
title: Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
zbMATH Open document ID: 0794.68071
DOI: 10.1007/BF01240736
author: Yaron Pinto
author: Ron Shamir
published in: Algorithmica
publication date: 1994-04-17T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 529942
zbMATH Keywords: minimum-cost flow
zbMATH Keywords: convex costs
zbMATH Keywords: multiple arcs
zbMATH Keywords: networks
zbMATH Keywords: strongly polynomial algorithms
MaRDI profile type: Publication
cites work: A parametric algorithm for convex cost network flow and related problems
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q3352816
cites work: Note—On the Merits of an “Approximation” to the Busy Period of the GI/G/1 Queue
cites work: A strongly polynomial minimum cost circulation algorithm
cites work: Q3707420
full work available at URL: https://doi.org/10.1007/bf01240736
OpenAlex ID: W1975879472
description: scientific article; zbMATH DE number 529942