Difference between revisions of "Dp 341 en"

From DCEwiki
Jump to: navigation, search
m (Kategorizace anotací.)
m (Oprava chyby javascriptové úpravy.)
 
Line 6: Line 6:
 
[[Diplomové práce 2009]]
 
[[Diplomové práce 2009]]
  
[[Media:_Dp_2009_hanakova_elvira.pdf|Download thesis in PDF]]
+
[[Media:Dp_2009_hanakova_elvira.pdf|Download thesis in PDF]]
  
 
[[Image:341_dp.gif]]
 
[[Image:341_dp.gif]]
Line 27: Line 27:
 
* '''Kutil Michal''', mailto:kutilm1@fel.cvut.cz
 
* '''Kutil Michal''', mailto:kutilm1@fel.cvut.cz
  
[[Soubor:tion of Flow Theory in the Transport Networks=
+
[[Soubor:Dp_2009_hanakova_elvira.pdf|thumb|left]]
 
 
'''Author''': Hanáková Elvíra                   
 
 
[[Diplomové práce 2009]]
 
 
 
[[Media:_Dp_2009_hanakova_elvira.pdf|thumb|left]]
 

Latest revision as of 03:05, 27 August 2014

Application of Flow Theory in the Transport Networks[edit]

Author: Hanáková Elvíra

Diplomové práce 2009

Download thesis in PDF

341 dp.gif

The thesis focuses on the network ows and on the algorithms designed to solve network's ows issues. Diploma work mainly desribes Multicommodity ow problem in the trafic. We mention a lot of algorithms specialized on such a problem as well as their usage, advantages and disadvantages. As a part of the work there are some examples from the "real life". Scope of the other part is implementation itself. Algorithms are explained and desribed in detail, including their inputs parametres and their usage.For all of these algorithms many measurements were made, which verify their time complexity. There is further documentation, selftests and demo attached to the work in the annexes and CD.

Dp 2009 hanakova elvira.pdf