Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. A. Andersson, Ch. Icking, R. Klein, and Th. Ottmann. Binary search trees of almost optimal height. Acta Informatica, 28:165–178, 1990.
2. A. Andersson, M. Tenhunen, and F. Ygge. Integer programming for combinatorial auction winner determination: Extended version. Technical report, Department of Information Technology, Uppsala University, July 2000. (Available from http://www.it.uu.se ).
3. K. Asrat and A. Andersson. Caching in multi-unit combinatorial auctions. In Proceedings of AAMAS, 2002.
4. E. Balas. An additive algorithm for solving linear programs with zero-one variables. The Journal of the Operations Research Society of America, pages 517–546, 1965.
5. E. Balas and M. W. Padberg. Set partitioning: A survey. SIAM Review, 18:710–760, 1976.