D. R. Beil and L. M. Wein, An Inverse-Optimization-Based Auction Mechanism to Support a Multiattribute RFQ Process, Management Science, vol.49, issue.11, pp.1529-1545, 2003.
DOI : 10.1287/mnsc.49.11.1529.20588

M. Bichler, M. Kaukal, and A. Segev, Multi-attribute auctions for electronic procurement, Proceedings of the First IBM IAC Workshop on Internet Based Negotiation Technologies, pp.18-19, 1999.

M. Bichler, A. Davenport, G. Hohner, and J. Kalagnanam, Industrial Procurement Auctions, Combinatorial Auction, 2006.
DOI : 10.7551/mitpress/9780262033428.003.0024

T. S. Chandrashekar, Y. Narahari, C. Rosa, D. Kulkarni, and J. Tew, Auction-Based Mechanisms for Electronic Procurement, IEEE Transactions on Automation Science and Engineering, vol.4, issue.3, 2005.
DOI : 10.1109/TASE.2006.885126
URL : http://eprints.iisc.ernet.in/14243/1/auction.pdf

V. Chandru and M. R. Rao, Integer programming, Handbook of Algorithms and Theory of Computing, pp.32-33, 1999.

C. Cordier, H. Marchand, R. Laundy, and L. A. Wolsey, bc-opt: A branchand-cut code for mixed integer programs Catholique de Louvain -Center for Operations Research and Economics, Papers, vol.9778, 1997.

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, 1990.

A. Davenport, J. Kalagnanam, and I. Research, Price Negotiations for Procurement of Direct Inputs, 2001.
DOI : 10.1007/978-1-4684-9277-4_3

W. Elmaghraby and P. Keskinocak, Technology for transportation bidding at the home depot In Practice of Supply Chain Management: Where Theory and Practice Converge, 2003.

W. Elmaghraby, Auctions and Pricing in E-Marketplaces, Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era, International Series in Operations Research and Management Science, 2004.
DOI : 10.1007/978-1-4020-7953-5_6

M. Eso, S. Ghosh, J. Kalagnanam, and L. Ladanyi, Bid evaluation in procurement auctions with piece-wise linear supply curves, Research Report RC IBM Research, vol.22219, 2001.

G. Hohner, J. Rich, E. Ng, G. Reid, J. Andrew et al., Combinatorial and quantity discount procurement auctions provide benefits to mars, incorporated and to its suppliers, INTER- FACES, vol.33, issue.1, pp.23-35, 2003.

I. Cplex, ILOG Concert Technology 1.1 User's Manual, 2001.

I. Cplex, ILOG CPLEX 10.0 User's Manual, 2006.

S. Kameshwaran and L. Benyoucef, Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions, Proceedings of the Second International Conference on Algorithmic Aspects in Information and Management (AAIM'06), Lecture Notes in Computer Science, 2006.
DOI : 10.1007/11775096_35

S. Kameshwaran, L. Benyoucef, and X. Xie, Discount auctions for procuring heterogeneous items, Proceedings of the 7th international conference on Electronic commerce , ICEC '05, 2005.
DOI : 10.1145/1089551.1089599

S. Kameshwaran, L. Benyoucef, and X. Xie, Winner Determination in Discount Auctions, Proceedings of Workshop on Internet and Network Economics (WINE 2005), pp.868-877, 2005.
DOI : 10.1007/11600930_88

S. Kameshwaran and Y. Narahari, e-Procurement Using Goal Programming, Proceedings of 4th International Conference on Electronic Commerce and Web Technologies, pp.6-15, 2003.
DOI : 10.1007/978-3-540-45229-4_2

S. Kameshwaran and Y. Narahari, A lagrangian heuristic for bid evaluation in e-procurement auctions, IEEE International Conference on Automation Science and Engineering, 2005., pp.220-225, 2005.
DOI : 10.1109/COASE.2005.1506772

A. Kothari, D. C. Parkes, and S. Suri, Approximately strategy proof and tractable multi-unit auctions, Proceedings of ACM Conference on Electronic Commerce, 2003.

D. Lehmann, R. Müller, and T. Sandholm, The Winner Determination Problem, Combinatorial Auction, chapter 12, 2006.
DOI : 10.7551/mitpress/9780262033428.003.0013

R. P. Mcafee and J. Mcmillan, Auctions and bidding, Journal of Economic Literature, vol.25, pp.699-738, 1987.

J. E. Mitchell, Integer programming: Branch-and-cut algorithms, Encyclopedia of Optimization, pp.519-525, 2001.
DOI : 10.1007/978-0-387-74759-0_287

J. E. Mitchell, Branch-and-cut algorithms for combinatorial optimization problems, Handbook of Applied Optimization, pp.65-77, 2002.

D. Pisinger and P. Toth, Knapsack Problems, Handbook of Combinatorial Optimization, pp.299-428, 1998.
DOI : 10.1007/978-1-4613-0303-9_5

T. Sandholm, S. Suri, A. Gilpin, and D. Levine, CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions, Management Science, vol.51, issue.3, pp.374-390, 2005.
DOI : 10.1287/mnsc.1040.0336

L. A. Wolsey, Valid inequalities for 0???1 knapsacks and mips with generalised upper bound constraints, Discrete Applied Mathematics, vol.29, issue.2-3, pp.251-261, 1988.
DOI : 10.1016/0166-218X(90)90148-6

L. A. Wolsey, Integer Programming INRIA Unité de recherche INRIA Lorraine LORIA, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Futurs, des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex, 1998.

I. Unité-de-recherche and . Rennes, IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche, 2004.

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399