Incremental Algorithms for the Minimum Cost Flow Problem

  • LAURA CIUPALĂ, Iuliu Maniu
  • Published 2011

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… (More)

Topics

Cite this paper

@inproceedings{CIUPAL2011IncrementalAF, title={Incremental Algorithms for the Minimum Cost Flow Problem}, author={LAURA CIUPALĂ and Iuliu Maniu}, year={2011} }