Incremental algorithms for the minimum cost flow problem

Authors:
Laura Ciupală
Affiliations:
Department of Computer Science, University Transilvania of Braşov, Braşov, Romania
Venue:
Proceedings of the 15th WSEAS international conference on Computers
Year:
2011

Citing 4
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow

Mathematics of Operations Research
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
About minimum cost flow problem in networks with node capacities

ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Incremental algorithms may save computational time to solve different network flow problems. Let us consider a network in which we already established a minimum cost flow. We describe and solve the problem of establishing a minimum cost flow in this network after inserting a new arc and after deleting an existent arc. We focus on these problems because they arise in practice.