2 papers
cs.GT2002
Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics
Rica Gonen, Daniel Lehmann
Finding optimal solutions for multi-unit combinatorial auctions is a hard problem and finding approximations to the optimal solution is also hard. We investigate the use of Branch-…
cs.GT2002
Linear Programming helps solving large multi-unit combinatorial auctions
Rica Gonen, Daniel Lehmann
Previous works suggested the use of Branch and Bound techniques for finding the optimal allocation in (multi-unit) combinatorial auctions. They remarked that Linear Programming cou…