A new algorithm for solving the feasibility problem of a network flow
type: Item
instance of: scholarly article
title: A new algorithm for solving the feasibility problem of a network flow
zbMATH Open document ID: 1193.90049
author: Hassan Salehi Fathabadi
author: Mehdi Ghiyasvand
published in: Applied Mathematics and Computation
publication date: 2010-09-01T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5777026
zbMATH Keywords: operation research
zbMATH Keywords: network flow
zbMATH Keywords: infeasible network
zbMATH Keywords: scaling algorithm
zbMATH Keywords: positive cut
MaRDI profile type: Publication
full work available at URL: j.amc.2007.03.038
OpenAlex ID: W2050503419
cites work: Q3056948
cites work: Improved Time Bounds for the Maximum Flow Problem
cites work: A new approach for computing a most positive cut using the minimum flow algorithms
cites work: Beyond the flow decomposition barrier
cites work: A new approach to the maximum-flow problem
cites work: The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
cites work: Q3274170
cites work: A Faster Deterministic Maximum Flow Algorithm
cites work: Computing maximum mean cuts
cites work: Online load balancing and network flow
DOI: 10.1016/J.AMC.2007.03.038
description: scientific article; zbMATH DE number 5777026