Assortment optimization over time. (English) Zbl 1408.90304
Summary: In this note we introduce the problem of assortment optimization over time. We have a sequence of time steps and can introduce one new product per time step. Once introduced a product cannot be removed. The goal is to determine which products to introduce so as to maximize revenue over all time steps under some choice model. Given a \(1 / \alpha\)-approximation algorithm for the capacitated assortment optimization problem we give a \(1 / 2 \alpha\)-approximation algorithm for this problem.
References:
| [1] | Alptekinoglu, A.; Semple, J. H., The exponomial choice model: A new alternative for assortment and price optimization. technical report, (2013), Penn State, Smeal College of Business |
| [2] | Bernstein, F.; Kok, A. G.; Xie, L., Dynamic assortment customization with limited inventories. technical report, (2011), Duke University, Fuqua School of Business |
| [3] | Bront, J. J.M.; Mendez Diaz, I.; Vulcano, G., A column generation algorithm for choice-based network revenue management, Oper. Res., 57, 3, 769-784, (2009) · Zbl 1233.90061 |
| [4] | Caro, F.; Gallien, J., Dynamic assortment with demand learning for seasonal consumer goods, Manage. Sci., 53, 2, 276-292, (2007) · Zbl 1232.91420 |
| [5] | Caro, F.; Martinez de Albeniz, V.; Rusmevichientong, P., The assortment packing problem: multiperiod assortment planning for short-lived products, Manage. Sci., 60, 11, 2701-2721, (2014) |
| [6] | Cinar, E.; Martinez-de-Albeniz, V., A closed-loop approach to dynamic assortment planning. technical report, (2014), University of Navara, IESE Business School |
| [7] | Davis, J. M.; Gallego, G.; Topaloglu, H., Assortment optimization under variants of the nested logit model, Oper. Res., 62, 2, 250-273, (2014) · Zbl 1295.90076 |
| [8] | Desir, A.; Goyal, V., An FPTAS for capacity constrained assortment optimization. technical report, (2013), Columbia University, School of Industrial Engineering and Operations Research |
| [9] | Feige, Uriel, A threshold of \(\ln n\) for approximating set cover, J. ACM, 45, 634-652, (1998) · Zbl 1065.68573 |
| [10] | Feige, Uriel; Lovász, László; Tetali, Prasad, Approximating MIN sum set cover, Algorithmica, 40, 219-234, (2004) · Zbl 1082.68126 |
| [11] | Feldman, J. B.; Topaloglu, H., Capacity constraints across nests in assortment optimization under the nested logit model. technical report, (2014), Cornell University, School of Operations Research and Information Engineering |
| [12] | Golrezaei, N.; Nazerzadeh, H.; Rusmevichientong, P., Real-time optimization of personalized assortments, Manage. Sci., 60, 6, 1532-1551, (2014) |
| [13] | Honhon, Dorothee; Gaur, Vishal; Seshadri, Sridhar, Assortment planning and inventory decisions under stock-out based substitution, Oper. Res., 58, 5, 1364-1379, (2010) · Zbl 1233.90022 |
| [14] | Mahajan, S.; van Ryzin, G., Stocking retail assortments under dynamic customer substitution, Oper. Res., 49, 3, 334-351, (2001) · Zbl 1163.90339 |
| [15] | Mendez-Diaz, I.; Bront, J. J.M.; Vulcano, G.; Zabala, P., A branch-and-cut algorithm for the latent-class logit assortment problem, Discrete Appl. Math., 36, 383-390, (2010) · Zbl 1237.90259 |
| [16] | Nemhauser, G. L.; Wolsey, L. A.; Fisher, M. L., An analysis of approximations for maximizing submodular set functions — I, Math. Program., 14, 265-294, (1978) · Zbl 0374.90045 |
| [17] | Rusmevichientong, P.; Shen, Z.-J. M.; Shmoys, D. B., Dynamic assortment optimization with a multinomial logit choice model and capacity constraint, Oper. Res., 58, 6, 1666-1680, (2010) · Zbl 1228.90170 |
| [18] | Talluri, K.; van Ryzin, G., Revenue management under a general discrete choice model of consumer behavior, Manage. Sci., 50, 1, 15-33, (2004) · Zbl 1168.91427 |
| [19] | Ulu, C.; Honhon, D.; Alptekinoglu, A., Learning consumer tastes through dynamic assortments, Oper. Res., 60, 4, 833-849, (2012) · Zbl 1342.91019 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
