Úloha o batohu
| Thesis title in Czech: | Úloha o batohu |
|---|---|
| Thesis title in English: | A knapsack problem |
| Key words: | celočíselné programování, optimální řešení, úloha batohu |
| English key words: | integer programming, optimal solution, A knapsack problem |
| Academic year of topic announcement: | 2017/2018 |
| Thesis type: | Bachelor's thesis |
| Thesis language: | čeština |
| Department: | Department of Probability and Mathematical Statistics (32-KPMS) |
| Supervisor: | doc. RNDr. Ing. Miloš Kopa, Ph.D. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 05.10.2017 |
| Date of assignment: | 05.10.2017 |
| Confirmed by Study dept. on: | 15.12.2017 |
| Date and time of defence: | 27.06.2018 08:00 |
| Date of electronic submission: | 17.05.2018 |
| Date of submission of printed version: | 18.05.2018 |
| Date of proceeded defence: | 27.06.2018 |
| Opponents: | doc. RNDr. Petr Lachout, CSc. |
| Guidelines |
| Student(ka) se seznámí s úlohami celočíselného programování. Zaměří se na různé formulace úlohy o batohu. Souhrně popíše algoritmy na řešení těchto úloh. Na praktické ukázce demonstruje výhody i nevýhody těchto algoritmů. |
| References |
| [1] CH. H. Papadimitriou, K. Steiglitz: Combinatorial optimization : algorithms and complexity, Dover Publications, Mineola New York, 1998.
[2] L. A. Wolsey: Integer programming, John Wiley & Sons, New York, 1998. [3] W. J. Cook et al.: Combinatorial optimization, John Wiley & Sons, New York, 1998. [4] R. von Randow: Integer programming and related areas, Berlin, Springer - Verlag, 1985. [5] Balas, E., Zemel, E.: Solving large zero-one knapsack problems, Operation Research, (1980) 28, pp. 1130-1154 |