National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
The multiple knapsack problem in use
Procházková, Lucie ; Sekničková, Jana (advisor) ; Suchánková, Tereza (referee)
In the area of integer linear programming problems is placed the knapsack problem, including its modifications. Among them is the multiple knapsack problem which is the subject of this thesis. In connection with the interpretation of results is necessary to extend the knapsack problem to integer conditions that are most often transformed into a bivalent conditions. This greatly increases the computational complexity of these tasks. Despite the fact that solutions exist for the exact algorithms, often in the calculation of some large problems can not be used. Approximate and sufficiently accurate results can be achieved by using heuristics and other techniques that have been created for this purpose. Subchapters in the first part further describe the variation of the knapsack problem, in the second part subchapters followed, and present some possible use in practice.

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