Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics