Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
type: Item
instance of: scholarly article
title: Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
zbMATH Open document ID: 0762.90025
DOI: 10.1016/0167-6377(92)90048-8
author: Refael Hassin
published in: Operations Research Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 95797
zbMATH Keywords: network flow
zbMATH Keywords: dual algorithm
zbMATH Keywords: polynomial algorithms
zbMATH Keywords: minimum cost circulation problem
MaRDI profile type: Publication
full work available at URL: 0167-6377(92)90048-8
OpenAlex ID: W2065932050
cites work: Note on Weintraub’s Minimum-Cost Circulation Algorithm
cites work: Q5523467
cites work: A dual algorithm for submodular flow problems
cites work: Q5583694
cites work: Diagonal similarity and equivalence for matrices over groups with 0
cites work: Canceling most helpful total cuts for minimum cost network flow
cites work: Finding minimum-cost circulations by canceling negative cycles
cites work: The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
cites work: Computing maximum mean cuts
cites work: A Primal Algorithm to Solve Network Flow Problems with Convex Costs
cites work: A bad network problem for the simplex method and other minimum cost flow algorithms
description: scientific article; zbMATH DE number 95797