Benseny, AntoniBigas Comas, Albert2021-11-152021-11-152021-01-24https://hdl.handle.net/2445/181191Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Antoni Benseny[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.40 p.application/pdfcatcc-by-nc-nd (c) Albert Bigas Comas, 2021http://creativecommons.org/licenses/by-nc-nd/3.0/es/Anàlisi de xarxes (Planificació)Treballs de fi de grauXarxes (Matemàtica)Optimització matemàticaTeoria de grafsNetwork analysis (Planning)Bachelor's thesesNets (Mathematics)Mathematical optimizationGraph theoryinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess