Winner determination (WDP) is a key problem in combinatorial auctions with many applications.
We develop a clique-based branch-and-bound algorithm for the WDP.
We show extensive computational results on three test suites of popular WDP benchmark instances.
We compare the performance with the general CPLEX 12.4 solver.
We demonstrate both approaches complement each other.