Czech
Theory of Transport
- Course Code:
- 17TEDI
- Academic Degree:
- doctoral
- Study Programme:
-
Engineering Informatics (P 3902)
language study field / specialization 
I Engineering Informatics of Transportation and Communication - 3902V036 - Form of Study:
- full-time and part-time
- Type of Course:
- optional
- Course Completion:
- exam v DB je chyba..
- Supervising Department:
- Department of Logistics and Management of Transport (16117)
- Abstract:
- • Paths in undirected graphs • Paths in directed graphs • Minimum spanning trees, Eulerian and Hamiltonian graphs • Traveling salesman problem, Vehicle routing problem, heuristic methods • Network flow • Graph planarity • Graph coloring • Trees • Assignment problem • Location and allocation problems • Discrete location problems • Continuous location problems • Discrete optimization problems and their solution • Application of genetic algorithms to discrete optimization problems • Selected topics from mathematical optimization of transportation problems
Calendars at the Faculty of Transportation Sciences, CTU in Prague
Guide to Using Calendars (in Czech) 