Dynamic network flows with arc changes

1 January 1974

journal article
Published by Wiley in Networks

Vol. 4 (3) , 255-265
https://doi.org/10.1002/net.3230040305

Abstract

This paper modifies Ford and Fulkerson's Maximum Dynamic Flow Algorithm so that additional arcs can be added to or deleted from the network at a later time period.

Keywords

NETWORK FLOWS
FORD
LATER
DELETED
FULKERSON'S
ARC CHANGES
FLOWS WITH ARC
DYNAMIC NETWORK

This publication has 3 references indexed in Scilit:

A Note on an Algebra for the k Best Routes in a Network
IMA Journal of Applied Mathematics, 1973
An Appraisal of Some Shortest-Path Algorithms
Operations Research, 1969
Flows in Networks
Published by Walter de Gruyter GmbH ,1963