1. Ahuja, R.K., T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall, New Jersey, 1993.
2. Ausubel, L. (1997): “An Efficient Ascending-Bid Auction for Multiple Objects,”
http://www.ausubel.com/auction-papers/97wp-efficient-ascending-auction.pdf
. Working Paper 97–06, Department of Economics, University of Maryland.
3. Bertsimas, D. and C.-P. Teo (1998): “From Valid Inequalities to Heuristics: A Unified View of Primal-dual Approximation Algorithms in Covering Problems,” Operations Research, 46, 503–514.
4. Bikhchandani, S. and J. Ostroy (2000a): “The Package Assignment Model,” mimeo, U.C.L.A.
5. —— (2000b): “Ascending Price Vickrey Auctions,” mimeo, U.C.L.A.