Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
From MaRDI portal
Publication:3098330
DOI10.1287/opre.1100.0866zbMath1228.90170MaRDI QIDQ3098330
Paat Rusmevichientong, David B. Shmoys, Zuo-Jun Max Shen
Publication date: 17 November 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1100.0866
90C90: Applications of mathematical programming
90C27: Combinatorial optimization
90C39: Dynamic programming
Related Items
Learning to Optimize via Information-Directed Sampling, Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model, Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences, Unnamed Item, Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models, Customer Choice Models vs. Machine Learning: Finding Optimal Product Displays on Alibaba, Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection, A regret lower bound for assortment optimization under the capacitated MNL model with arbitrary revenue parameters, Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets, Constrained Assortment Optimization Under the Paired Combinatorial Logit Model, Technical Note—Capacitated Assortment Optimization: Hardness and Approximation, Robust Learning of Consumer Preferences, Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues, Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information, Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays, Tractable Approximations for Assortment Planning with Product Costs, Technical Note—Assortment Optimization with Small Consideration Sets, MNL-Bandit: A Dynamic Learning Approach to Assortment Selection, Approximation Algorithms for Product Framing and Pricing, Assortment Optimization Under the Paired Combinatorial Logit Model, Pricing and Assortment Strategies with Product Exchanges, The Approximability of Assortment Optimization Under Ranking Preferences, Learning in Combinatorial Optimization: What and How to Explore, Joint location and cost planning in maximum capture facility location under random utilities, Stochastic approximation for uncapacitated assortment optimization under the multinomial logit model, Constrained multi‐location assortment optimization under the multinomial logit model, Assortment optimization with position effects under the nested logit model, Data‐driven research in retail operations—A review, Callable products with dependent demands, A gradient descent method for estimating the Markov chain choice model, A tractable online learning algorithm for the multinomial logit contextual bandit, Multi-plant manufacturing assortment planning in the presence of transshipments, Assortment optimization under a multinomial logit model with position bias and social influence, Logit network pricing, Willingness-to-pay estimation with choice-based conjoint analysis: addressing extreme response behavior with individually adapted designs, A branch-and-cut algorithm for the latent-class logit assortment problem, A review of choice-based revenue management: theory and methods, Capacitated assortment and price optimization under the nested logit model, Solving utility-maximization selection problems with multinomial logit demand: is the first-choice model a good approximation?, A PTAS for capacitated sum-of-ratios optimization, Assortment optimization under the sequential multinomial logit model, Retail store operations: literature review and research directions, Capacitated assortment and price optimization for customers with disjoint consideration sets, Assortment planning with nested preferences: dynamic programming with distributions as states?, Assortment optimization over time, On the sum-product ratio problem and its applications, Capacitated assortment and price optimization under the multinomial logit model, Quality and pricing decisions in production/inventory systems, Optimal bundle composition in competition for continuous attributes, Purchase preferences-based air passenger choice behavior analysis from sales transaction data, Sequence independent lifting for a set of submodular maximization problems, Optimizing revenue while showing relevant assortments at scale, Assortment optimization in omni-channel retailing, Robust assortment optimization under sequential product unavailability, Fractional 0-1 programming and submodularity, Combinatorial assortment optimization, Capacitated strategic assortment planning under explicit demand substitution, Discovering heterogeneous consumer groups from sales transaction data, Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations, A note on a tight lower bound for capacitated MNL-bandit assortment selection models, Assortment planning for vertically differentiated products under a consider-then-choose model, Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments, An efficient method for joint product line selection and pricing with fixed costs, An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers, Assortment optimization with repeated exposures and product-dependent patience cost, The Exponomial Choice Model: A New Alternative for Assortment and Price Optimization, Assortment Optimization Under Variants of the Nested Logit Model, A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice, Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings, Dynamic Assortment Personalization in High Dimensions, Multi-Product Price and Assortment Competition, Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model, Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds
Uses Software
