Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model
Published Online:1 Jun 2015https://doi.org/10.1287/opre.2015.1383
References
- (2009) A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3):769–784.Link, Google Scholar
- (2010) Approximating a class of combinatorial problems with rational objective function. Math. Programming 124(1–2):255–269.Crossref, Google Scholar
- (2014) Assortment optimization under variants of the nested logit model. Oper. Res. 62(2):250–273.Link, Google Scholar
- (2013) An FPTAS for capacity constrained assortment optimization. Technical report, Columbia University, School of Industrial Engineering and Operations Research.Google Scholar
- (1984) Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses. Eur. J. Oper. Res. 15:100–109.Crossref, Google Scholar
- (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, Google Scholar
- (2004) Managing flexible products on a network. Technical report, Columbia University.Google Scholar
- (2014) Nested logit or random coefficients logit? A comparison of alternative discrete choice models of product differentiation. Rev. Econom. Statist. 96(5):916–935.Crossref, Google Scholar
- (1987) Approxiation algorithms for combinatorial fractional programming problems. Math. Programming 37(3):255–267.Crossref, Google Scholar
- (2014) A greedy algorithm for assortment optimization in the two-level nested logit model. Oper. Res. Lett. 42(5):319–324.Crossref, Google Scholar
- (1959) Individual Choice Behavior: A Theoretical Analysis (John Wiley & Sons, New York).Google Scholar
- (1974) Conditional logit analysis of qualitative choice behavior. Zarembka P, ed., Frontiers in Economics (Academic Press, New York), 105–142.Google Scholar
- (1979) Combinatorial optimization with rational objective functions. Math. Oper. Res. 4(4):414–424.Link, Google Scholar
- (2010) A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. 36:383–390.Google Scholar
- (2013) A general framework for designing approximation schemes for combinatorial optimization problems with many objectives combined into one. Oper. Res. 61(2):389–397.Link, Google Scholar
- (1994) Markov Decision Processes (John Wiley & Sons New York).Crossref, Google Scholar
- (2009) A PTAS for capacitated sum-of-ratios optimization. Oper. Res. Lett. 37(4):230–238.Crossref, Google Scholar
- (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.Link, Google Scholar
- (2014) Assortment optimization under the multinomial logit model with random choice parameters. Production Oper. Management 23(11):2023–2039.Crossref, Google Scholar
- (1979) The multiple-choice knapsack problem. Oper. Res. 27(3):503–515.Link, Google Scholar
- (2009) Merge-simulations of unilateral effects: What can we learn from the UK brewing industry? Lyons B, ed., Cases in European Competition Policy: The Economic Analysis (Cambridge University Press, Cambridge), 312–346.Crossref, Google Scholar
- (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.Link, Google Scholar
- (2003) Discrete Choice Methods with Simulation (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
- (1987) The demand for local telephone service: A fully discrete model of residential calling patterns and service choices. The RAND J. Econom. 18(1):109–123.Crossref, Google Scholar
- (2012) Capacitated assortment and price optimization under the multinomial logit model. Oper. Res. Lett. 40:492–497.Crossref, Google Scholar
- (2013) Assortment management under the generalized attraction model with a capacity constraint. J. Revenue and Pricing Management 12(3):254–270.Crossref, Google Scholar

