Abstract
Nowadays, it is popular that the dealer makes profits by selling a kind of discount coupons, which can be used as money to purchase commodities with total cost less than or equal to the face value of the coupon. We can purchase a coupon at a price of 0 < s ≤ 1 times its face value and the number of potential purchasable coupons is a given integer l. The customer has the option to buy the goods by cash completely or by a discount coupon. However, each piece of goods can only use one coupon and the coupon used must have enough balance for the goods. The objective is to minimize the total cost for purchasing all the goods. In this paper, we reduce the problem to a special bin packing model. We consider the online problems for all 0 < s ≤ 1 and 1 ≤ l ≤ ∞. We present optimal online algorithms for all 0 < s ≤ 1 when l = ∞ and l = 1. For 2 ≤ l < ∞, we give both a lower bound and an algorithm, and show the algorithm is optimal for l = 2.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Basse, S.: Computer algorithms: Introduction to design and analysis. Addison-Wesley, Reading (1988)
Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation algorithms for NP-hard problems, pp. 46–93. PWS Publishing (1997)
Dósa, G., He, Y.: Bin packing problems with rejection penalties and their dual problems. Information and Compution 204, 795–815 (2006)
Epstein, L.: Bin packing with rejection revisited. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, Springer, Heidelberg (2007)
Fiat, A., Woeginger, G.: On-line Algohithms: The State of Art. LNCS, vol. 1442, pp. 1–12. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, Y., Zhang, A., Tan, Z. (2007). Online Coupon Consumption Problem. In: Chen, B., Paterson, M., Zhang, G. (eds) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. ESCAPE 2007. Lecture Notes in Computer Science, vol 4614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74450-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-74450-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74449-8
Online ISBN: 978-3-540-74450-4
eBook Packages: Computer ScienceComputer Science (R0)