@TechReport{	  it:1999-016,
  author	= {Arne Andersson and Mattias Tenhunen and Fredrik Ygge},
  title		= {Integer Programming for Automated Auctions},
  institution	= {Department of Information Technology, Uppsala University},
  department	= {Computing Science Division},
  year		= {1999},
  number	= {1999-016},
  month		= nov,
  note		= {Final version published at ICMAS-00 available from
		  \url{http://www.csd.uu.se/~arnea/abs/icmas00.html}},
  abstract	= {Auctions allowing bids for combinations of items are
		  important for (agent mediated) electronic commerce;
		  compared to other auction mechanisms, they often increase
		  the efficiency of the auction, while keeping risks for
		  bidders low. The determination of an optimal winner
		  combination in this type of auctions is a complex
		  computational problem, which has recently attracted some
		  research, and in this paper, we look further into the topic.
		  
		  It is well known that the winner determination problem for
		  a certain class of auctions is equivalent to what in the
		  operations research community is referred to as (weighted)
		  set packing. In this paper we compare some of the recent
		  winner determination algorithms to traditional set packing
		  algorithms, and study how more general auctions can be
		  modeled by use of standard integer programming methods. }
}