Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/181191
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Benseny, Antoni | - |
dc.contributor.author | Bigas Comas, Albert | - |
dc.date.accessioned | 2021-11-15T11:35:40Z | - |
dc.date.available | 2021-11-15T11:35:40Z | - |
dc.date.issued | 2021-01-24 | - |
dc.identifier.uri | http://hdl.handle.net/2445/181191 | - |
dc.description | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Antoni Benseny | ca |
dc.description.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. | ca |
dc.format.extent | 40 p. | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | cat | ca |
dc.rights | cc-by-nc-nd (c) Albert Bigas Comas, 2021 | - |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
dc.source | Treballs Finals de Grau (TFG) - Matemàtiques | - |
dc.subject.classification | Anàlisi de xarxes (Planificació) | ca |
dc.subject.classification | Treballs de fi de grau | - |
dc.subject.classification | Xarxes (Matemàtica) | ca |
dc.subject.classification | Optimització matemàtica | ca |
dc.subject.classification | Teoria de grafs | ca |
dc.subject.other | Network analysis (Planning) | en |
dc.subject.other | Bachelor's theses | - |
dc.subject.other | Nets (Mathematics) | en |
dc.subject.other | Mathematical optimization | en |
dc.subject.other | Graph theory | en |
dc.title | Algorismes de flux màxim en xarxes de flux | ca |
dc.type | info:eu-repo/semantics/bachelorThesis | ca |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca |
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