Řešení aukcí pomocí metody větvení a mezí

Nowadays, when someone hears the term auction, he imagine is an auction room and participants up their bids to get the items which they want. This is only one of many auctions that exist. The aim of this Bachelor's Thesis is inform the readers with auctions, because they are now very popular solution for buying or selling goods. More attention is paid to the combinatorial auctions where are offered so called bundles (combination of objects) and buyers can express their preference for each bundle. The greater part of work is focused on solving these auctions. In the view of the fact that exist a lot of algorithms that solve combinatorial auctions, the topic was narrowed only to the branch-and-bound method and its modifications. Thanks to this, the four basic algorithms were chosen -- branch-and-bound method, Balas' Method, Sandholm IDA* algorithm and CABOB algorithm. Two solvers are used for solving examples, that represent two of aforementioned algorithms.