A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
type: Item
instance of: scholarly article
title: A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
zbMATH Open document ID: 0597.90029
DOI: 10.1007/BF01580882
author: Satoru Fujishige
published in: Mathematical Programming
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3963535
zbMATH Keywords: capacity-rounding algorithm
zbMATH Keywords: strongly polynomial algorithm
zbMATH Keywords: minimum-cost circulation problem
zbMATH Keywords: maximum flow
zbMATH Keywords: computational complexity
zbMATH Keywords: shortest path
MaRDI profile type: MaRDI publication profile
cites work: A Primal-Dual Algorithm for Submodular Flows
cites work: Q5624995
cites work: Q4149476
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q3292914
cites work: Network flow, transportation and scheduling. Theory and algorithms
cites work: Q3048571
cites work: Q3678944
full work available at URL: https://doi.org/10.1007/bf01580882
OpenAlex ID: W2053760675
Recommended article: A strongly polynomial minimum cost circulation algorithm
Recommended article: Q3678944
Recommended article: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
Recommended article: Finding minimum-cost circulations by canceling negative cycles
Recommended article: On dual minimum cost flow algorithms
description: scientific article