## Abstract

A new algorithm is presented for finding maximal and maximum value flows in directed single‐commodity networks. Commonly algorithms developed for this problem find a maximal flow by gradually augmenting (increasing) a feasible flow to a maximal flow. In the presented algorithm, at the beginning of each step or iteration, the flow on arcs is assigned to flow capacity. This may lead to an infeasible flow violating flow conservation at some nodes. During two passes of a MAIN step, consisting of a forward pass and a backward pass, the flow is reduced on some arcs to regain feasibility. The network is then pruned by omitting saturated arcs, and the process is repeated. The parallel implementation of the algorithm applies the two main steps at the same time to the same network. The outputs of the two steps are compared and the processing continues with the higher feasible flow. The algorithm is simple, intuitive, and efficient. © 1993 John Wiley & Sons, Inc.

Original language | English (US) |
---|---|

Pages (from-to) | 393-414 |

Number of pages | 22 |

Journal | Naval Research Logistics |

Volume | 40 |

Issue number | 3 |

DOIs | |

State | Published - 1993 |

Externally published | Yes |

## ASJC Scopus subject areas

- Modeling and Simulation
- Ocean Engineering
- Management Science and Operations Research