Dynamic Assortment Optimization for Reusable Products with Random Usage Durations
暂无分享,去创建一个
Huseyin Topaloglu | Mika Sumida | Paat Rusmevichientong | P. Rusmevichientong | Huseyin Topaloglu | Mika Sumida | Paat Rusmevichientong
[1] Guillermo Gallego,et al. A minmax distribution free procedure for the (Q, R) inventory model , 1992, Oper. Res. Lett..
[2] G. Ryzin,et al. Optimal dynamic pricing of inventories with stochastic demand over finite horizons , 1994 .
[3] John N. Tsitsiklis,et al. Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.
[4] G. Ryzin,et al. On the Relationship Between Inventory Costs and Variety Benefits in Retailassortments , 1999 .
[5] Garrett J. van Ryzin,et al. Stocking Retail Assortments Under Dynamic Consumer Substitution , 2001, Oper. Res..
[6] K. Talluri,et al. The Theory and Practice of Revenue Management , 2004 .
[7] G. Iyengar,et al. Managing Flexible Products on a Network , 2004 .
[8] Garrett J. van Ryzin,et al. Revenue Management Under a General Discrete Choice Model of Consumer Behavior , 2004, Manag. Sci..
[9] Dan Zhang,et al. Revenue Management for Parallel Flights with Customer-Choice Behavior , 2005, Oper. Res..
[10] Benjamin Van Roy,et al. An Approximate Dynamic Programming Approach to Network Revenue Management , 2006 .
[11] Daniel Adelman,et al. Dynamic Bid Prices in Revenue Management , 2007, Oper. Res..
[12] Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources , 2008 .
[13] Garrett J. van Ryzin,et al. On the Choice-Based Linear Programming Model for Network Revenue Management , 2008, Manuf. Serv. Oper. Manag..
[14] Dan Zhang,et al. An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice , 2009, Transp. Sci..
[15] Sridhar Seshadri,et al. Assortment Planning and Inventory Decisions Under Stockout-Based Substitution , 2009, Oper. Res..
[16] Huseyin Topaloglu,et al. A New Dynamic Programming Decomposition Method for the Network Revenue Management Problem with Customer Choice Behavior , 2010 .
[17] Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources , 2010, Oper. Res..
[18] R. Phillips,et al. The Oxford Handbook of Pricing Management , 2012 .
[19] Richard Ratliff,et al. Estimating Primary Demand for Substitutable Products from Sales Transaction Data , 2011, Oper. Res..
[20] G. Gallego,et al. Assortment Planning Under the Multinomial Logit Model with Totally Unimodular Constraint Structures , 2013 .
[21] Hamid Nazerzadeh,et al. Real-time optimization of personalized assortments , 2013, EC '13.
[22] Huseyin Topaloglu. Joint Stocking and Product Offer Decisions Under the Multinomial Logit Model , 2013 .
[23] Huseyin Topaloglu,et al. Assortment Optimization Under Variants of the Nested Logit Model , 2014, Oper. Res..
[24] Hamid Nazerzadeh,et al. Real-Time Optimization of Personalized Assortments , 2014, Manag. Sci..
[25] Huseyin Topaloglu,et al. On the Approximate Linear Programming Approach for Network Revenue Management Problems , 2014, INFORMS J. Comput..
[26] Huseyin Topaloglu,et al. Constrained Assortment Optimization for the Nested Logit Model , 2014, Manag. Sci..
[27] Jim Dai,et al. Choice Based Revenue Management for Parallel Flights , 2014 .
[28] J. Dai,et al. Choice Based Revenue Management for Parallel Flights , 2014 .
[29] P. Rusmevichientong,et al. Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters , 2014 .
[30] Guang Li,et al. The d-Level Nested Logit Model: Assortment and Price Optimization Problems , 2015, Oper. Res..
[31] Richard Ratliff,et al. A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice , 2015, Oper. Res..
[32] Dan Zhang,et al. Reductions of Approximate Linear Programs for Network Revenue Management , 2015, Oper. Res..
[33] Huseyin Topaloglu,et al. Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model , 2015, Oper. Res..
[34] Stefanus Jasin,et al. Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements , 2016 .
[35] Danny Segev,et al. Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand , 2015, Oper. Res..
[36] Retsef Levi,et al. Revenue Management of Reusable Resources with Advanced Reservations , 2017 .
[37] Huseyin Topaloglu,et al. Assortment Optimization under the Paired Combinatorial Logit Model , 2017 .
[38] Van-Anh Truong,et al. Online Advance Admission Scheduling for Services with Customer Preferences. , 2018, 1805.10412.
[39] David Simchi-Levi,et al. Price and Assortment Optimization for Reusable Resources , 2018 .
[40] Danny Segev,et al. Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences , 2015, Oper. Res..
[41] Danny Segev,et al. Approximation Algorithms for Dynamic Assortment Optimization Models , 2019, Math. Oper. Res..
[42] Huseyin Topaloglu,et al. Assortment Optimization Under the Paired Combinatorial Logit Model , 2020, Oper. Res..