Optimal solutions for multi-unit combinatorial auctions

This publication has 6 references indexed in Scilit:

• Bidding and allocation in combinatorial auctions
  Published by Association for Computing Machinery (ACM) ,2000
• Truth revelation in approximately efficient combinatorial auctions
  Published by Association for Computing Machinery (ACM) ,1999
• Clique is hard to approximate within n1−ε
  Acta Mathematica, 1999
• A class of generalized greedy algorithms for the multi-knapsack problem
  Discrete Applied Mathematics, 1993
• Branch-and-Bound Methods: A Survey
  Operations Research, 1966
• COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS
  The Journal of Finance, 1961