Minimum cost flow in a network with an overestimated arc capacity

DOI10.31926/BUT.MIF.2019.12.61.1.9zbMath1438.90049OpenAlexW3000607354MaRDI QIDQ4973760

Adrian Deaconu, Laura Ciupală

Publication date: 5 December 2019

Published in: Bulletin of the Transilvania University of Brasov Series III Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.31926/but.mif.2019.12.61.1.9

zbMATH Keywords

minimum cost flownetwork flowincremental algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

This page was built for publication: Minimum cost flow in a network with an overestimated arc capacity