Heuristikou řízené hledání optima v NP-těžkých úlohách
Heuristic-driven methods finding optimum for NP-hard problems
bachelor thesis (DEFENDED)

View/ Open
Permanent link
http://hdl.handle.net/20.500.11956/37918Identifiers
Study Information System: 63236
Collections
- Kvalifikační práce [11325]
Author
Advisor
Referee
Surynek, Pavel
Faculty / Institute
Faculty of Mathematics and Physics
Discipline
General Computer Science
Department
Department of Applied Mathematics
Date of defense
17. 9. 2010
Publisher
Univerzita Karlova, Matematicko-fyzikální fakultaLanguage
Czech
Grade
Excellent