National Repository of Grey Literature 2 records found  Search took 0.07 seconds. 
Generalized assignment problem
Kocourková, Markéta ; Sekničková, Jana (advisor) ; Nečas, Dalibor (referee)
The generalized assignment problem is a topic of this thesis. The knapsack problem in general belongs to among classical operation research problems and belongs to the category of integer linear programming. It is very often formulated as a binary problem or 0-1. There are several types of knapsack problems which are described in this thesis. Some of the knapsack problems are so large and although exist exact algorithms for finding optimal solution, heuristics are rather used. They are not so exact but they find solution much earlier. Therefore some of the knapsack problems belong to NP-hard problems. This thesis is focused on one type particularly, the generalized assignment problem, which is demonstrated on practical example how the problem can be used.
The Optimization Methods with Utilization of the Simulation in MS Exel
Škulavíková, Štěpánka ; Kuncová, Martina (advisor) ; Fábry, Jan (referee)
Thesis is based on original self-made application programmed at VBA in MS Excel 2007. The reason to build this application was integration of simulation Monte Carlo and chosen optimization methods. The application allows do simulation of the knapsack problem and of the assignment problem with uncertainty. The parameters of these models are possible to set up as changing values in dependence of chosen probability distribution. Output of the simulation is a probability recommendation which objects should be used. Choose of objects depend on optimized models. Results of both models are represented by statistical indexes, tables of parameters and graph.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.