# name
Algorismes de flux màxim en xarxes de flux

# metadata.dc.description[].value
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Antoni Benseny

# metadata.dc.description.abstract[].value
[en] The aim of this project is to study the maximum flow problem in a flow network. It consists of finding the maximum flow capacity that any given flow network can hold, from a source node to a sink node. We will use the generic preflow-push algorithm, the FIFO preflow-push algorithm and the highest-label preflow-push algorithm. Furthermore, we will use an adaptation of the generic preflow-push specific for bipartite networks that will
be used in a real life situation such as the Baseball Elimination. Finally, we would be able to analyse the direct implementation of the algorithms as well as examining the results in a simulator.

# metadata.dc.rights[].value
cc-by-nc-nd (c) Albert Bigas Comas, 2021

# metadata.dc.source[].value
Treballs Finals de Grau (TFG) - Matemàtiques

# metadata.dc.title[].value
Algorismes de flux màxim en xarxes de flux