Exact algorithms for procurement problems under a total quantity discount structure

European Journal of Operational Research

Volumn 178, Issue 2, 2007, Pages 603-626

  Goossens, D R ^a   Maas, A J T ^b   Spieksma, F C R ^a   van de Klundert, J J ^c  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b RIKS BV   (Netherlands)

^c MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Auctions bidding; Branch and bound; Min cost flow; Procurement

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

BRANCH AND BOUND ALGORITHMS; MIN-COST FLOW; PROCUREMENT PROBLEMS; TOTAL QUANTITY DISCOUNT POLICY;

RESOURCE ALLOCATION;

EID: 33751001338     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.03.010     Document Type: Article

References (20)

1. Austin L.M., and Hogan W.W. Optimizing the procurement of aviation fuels. Management Science 22 5 (1976) 515-527
2. Bichler, M., Kalagnanam, J.R., Lee, H.S., Lee, J., 2002. Winner determination algorithms for electronic auctions: A framework design. In: E-Commerce and Web Technologies, Third International Conference, EC-Web 2002, Aix-en-Provence, September 2002, Springer, pp. 37-46.
3. Chauhan S.S., Eremeev A.V., Romanova A.A., Servakh V.V., and Woeginger G.J. Approximation of the supply scheduling problem. Operations Research Letters 33 3 (2005) 249-254
4. Crama Y., Pascual J.R., and Torres A. Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes. European Journal of Operational Research 159 2 (2004) 364-378
5. Davenport A.J., and Kalagnanam J.R. Price negotiations for procurement of direct inputs. In: Dietrich B., and Vohra R.V. (Eds). Mathematics of the Internet: E-auction and Markets (2002), Springer, New York 27-43
6. Degraeve Z., Labro E., and Roodhooft F. An evaluation of vendor selection models from a total cost of ownership perspective. European Journal of Operational Research 125 (2000) 34-58
7. Eso, M., Ghosh, S., Kalagnanam, J.R., Ladanyi, L., 2001. Bid evaluation in procurement auctions with piece-wise linear supply curves. IBM Research Report RC22219.
8. Goossens D., and Spieksma F.C.R. On the complexity of the transportation problem with exclusionary side constraints. In: Dullaert W., Vernimmen B., and Wiltox F. (Eds). Proceedings of the BIVEC-GIBET Transport Day-Part I, Hasselt, November 2005 (2005), Hasselt University 351-358
9. Hohner G., Rich J., Ng E., Reid G., Davenport A.J., Kalagnanam J.R., Lee H.S., and An C. Combinatorial and quantity-discount procurement auctions benefit mars, incorporated and its suppliers. Interfaces 33 1 (2003) 23-35
10. Katz P., Sadrian A.A., and Tendick P. Telephone companies analyze price quotations with Bellcore's PDSS Software. Interfaces 24 1 (1994) 50-63
11. Kim D., and Pardalos P.M. Piecewise linear network flow problems. In: Pardalos P.M., Migdalas A., and Burkhard R. (Eds). Combinatorial and Global Optimization (2001), World Scientific 145-160
12. Kothari A., Parkes D., and Suri S. Approximately-strategyproof and tractable multi-unit auctions. Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), San Diego, June 2003 (2003), ACM 166-175
13. McConnel M.B., and Galligan D.T. The use of integer programming to select bulls across breeding companies with volume discounts. Journal of Diary Science 87 (2004) 3542-3549
14. Munson C.L., and Rosenblatt M.J. Theories and realities of quantity discounts: An explanatory study. Production and Operations Management 7 4 (1998) 352-369
15. Nemhauser G.L., and Wolsey L.A. Integer and combinatorial optimization (1988), Wiley, New York
16. Sadrian A.A., and Yoon Y.S. A procurement decision support system in business volume discount environments. Operations Research 42 1 (1994) 14-23
17. Shachnai, H., Shmueli, O., Sayegh, R., 2004. Approximation schemes for deal splitting and covering integer programs with multiplicity constraints. Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 2004, Springer, pp. 111-125.
18. Sun M. The transportation problem with exclusionary side constraints and two branch-and-bound algorithms. European Journal of Operational Research 140 (2002) 629-647
19. van de Klundert J.J., Kuipers J., Spieksma F.C.R., and Winkels M. Selecting telecommunication carriers to obtain volume discounts. Interfaces 35 2 (2005) 124-132
20. Xu J., Lu L.L., and Glover F. The deterministic multi-item dynamic lot size problem with joint business volume discount. Annals of Operations Research 96 1 (2000) 317-337