The thesis describes the principles of dynamic programming and it's application to concrete problems. (The travelling salesman problem, the knapsack problem, the shortest path priblem,the set covering problem.)
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:11211 |
| Date | January 2009 |
| Creators | Molnárová, Marika |
| Contributors | Pelikán, Jan, Fábry, Jan |
| Publisher | Vysoká škola ekonomická v Praze |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0016 seconds