### 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 |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

**A new polynomial algorithm for maximum value flow with an efficient parallel implementation.** / Waissi, Gary.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - A new polynomial algorithm for maximum value flow with an efficient parallel implementation

AU - Waissi, Gary

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84989758311&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84989758311&partnerID=8YFLogxK

U2 - 10.1002/1520-6750(199304)40:3<393::AID-NAV3220400308>3.0.CO;2-1

DO - 10.1002/1520-6750(199304)40:3<393::AID-NAV3220400308>3.0.CO;2-1

M3 - Article

AN - SCOPUS:84989758311

VL - 40

SP - 393

EP - 414

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 3

ER -