Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/181191
Title: | Algorismes de flux màxim en xarxes de flux |
Author: | Bigas Comas, Albert |
Director/Tutor: | Benseny, Antoni |
Keywords: | Anàlisi de xarxes (Planificació) Treballs de fi de grau Xarxes (Matemàtica) Optimització matemàtica Teoria de grafs Network analysis (Planning) Bachelor's theses Nets (Mathematics) Mathematical optimization Graph theory |
Issue Date: | 24-Jan-2021 |
Abstract: | [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. |
Note: | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Antoni Benseny |
URI: | http://hdl.handle.net/2445/181191 |
Appears in Collections: | Programari - Treballs de l'alumnat Treballs Finals de Grau (TFG) - Matemàtiques |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
mòduls simulador.zip | Mòduls simulador | 16.94 kB | zip | View/Open |
tfg_bigas_comas_albert.pdf | Memòria | 979.32 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License