Return to search

Algoritmy pro řešení speciálních problémů batohu a jejich výpočetní složitost / Algorithms for solving of special knapsack problems and their computational complexity

The thesis deals with knapsack problems variants and possibility of their solving, furthermore with the impact of particular task (instance) special structure on the effciency of tested approach. The thesis also proposes conversion possibility between described tasks and their continuous extension (continuous relaxation). It describes L3 algorithm and superdecreasing knapsack problem solving from the common sort of algorithms and Monte Carlo Method, simulated annealing and genetic algorithms from the sort of probability ones. Other possibilities are also discussed. Integral part of this thesis is the accompanying application, which was used to create groundwork used in the text and which can be also used to solve other instances.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:150159
Date January 2010
CreatorsSem, Štěpán
ContributorsIvánek, Jiří, Kalčevová, Jana
PublisherVysoká škola ekonomická v Praze
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.002 seconds