About the minimum mean cycle-canceling algorithm
type: Item
instance of: scholarly article
title: About the minimum mean cycle-canceling algorithm
zbMATH Open document ID: 1331.90088
author: Jean Bertrand Gauthier
author: Jacques Desrosiers
author: Marco E. Lübbecke
published in: Discrete Applied Mathematics
publication date: 2015-09-30T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6487388
zbMATH Keywords: network flow problem
zbMATH Keywords: residual network
zbMATH Keywords: flow decomposition
zbMATH Keywords: minimum mean cycle
zbMATH Keywords: complexity analysis
zbMATH Keywords: strongly polynomial algorithm
MaRDI profile type: Publication
full work available at URL: j.dam.2014.07.005
OpenAlex ID: W2153601281
cites work: Q3056948
cites work: Decomposition Principle for Linear Programs
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: An improved primal simplex algorithm for degenerate linear programs
cites work: Maximal Flow Through a Network
cites work: Q3292914
cites work: A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
cites work: An Experimental Study of Minimum Mean Cycle Algorithms
cites work: Finding minimum-cost circulations by canceling negative cycles
cites work: Q3266141
cites work: A characterization of the minimum cycle mean in a digraph
cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
cites work: Tight bounds on the number of minimum-mean cycle cancellations and related results
cites work: A new version of the improved primal simplex for degenerate linear programs
cites work: Q3908745
cites work: A data structure for dynamic trees
cites work: A strongly polynomial minimum cost circulation algorithm
cites work: Faster parametric shortest path and minimum‐balance algorithms
DOI: 10.1016/J.DAM.2014.07.005
description: scientific article; zbMATH DE number 6487388