|
Title:
|
NEW APPROACH FOR THE GENERALIZED MAXIMUM
FLOW PROBLEM |
|
Author(s):
|
Delia Elena Spridon, Adrian Marius Deaconu, Javad Tayyebi and Iulian Popa |
|
ISBN:
|
978-989-8704-62 |
|
Editors:
|
Paula Miranda and Pedro Isaías |
|
Year:
|
2024 |
|
Edition:
|
Single |
|
Keywords:
|
Minimum-Loss Path, Generalized Maximum Flow Problem |
|
Type:
|
Full |
|
First Page:
|
29 |
|
Last Page:
|
36 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
This study explores the application of minimum-loss path-finding algorithm to determine maximum flow in generalized
networks characterized by arc losses or gains. In the generalized problem, each arc, in addition to its corresponding
capacity, may also have a loss or gain factor that must be considered when calculating the maximum flow. In other words,
the generalized problem for determining maximum flow is an extension of the traditional maximum flow problem in a
network. In such a network, to determine the maximum amount of flow, other factors such as costs or variable arc
capacities must also be taken into account. This paper extends the algorithm Ford - Fulkerson, which has been adapted to
iteratively identify S-T paths with minimum loss. |
|
|
|
|
|
|
