Capacitated assortment and price optimization under the nested logit model
From MaRDI portal
Publication:785637
DOI10.1007/s10898-020-00896-xzbMath1447.91062OpenAlexW3012342973MaRDI QIDQ785637
Publication date: 7 August 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00896-x
Related Items
Technical Note—Capacitated Assortment Optimization: Hardness and Approximation, Joint location and cost planning in maximum capture facility location under random utilities
Cites Work
- A tractable discrete fractional programming: application to constrained assortment optimization
- A new polynomial-time algorithm for linear programming
- A PTAS for capacitated sum-of-ratios optimization
- Capacitated assortment and price optimization for customers with disjoint consideration sets
- A greedy algorithm for the two-level nested logit model
- Capacitated assortment and price optimization under the multinomial logit model
- Efficient formulations for pricing under attraction demand models
- Capacitated assortment and price optimization under the multilevel nested logit model
- Multiproduct price optimization under the multilevel nested logit model
- The Exponomial Choice Model: A New Alternative for Assortment and Price Optimization
- Assortment Optimization Under Variants of the Nested Logit Model
- Multiproduct Price Optimization and Competition Under the Nested Logit Model with Product-Differentiated Price Sensitivities
- Optimal and Competitive Assortments with Endogenous Pricing Under Hierarchical Consumer Choice Models
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis
- Discrete Choice Methods with Simulation
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- The d-Level Nested Logit Model: Assortment and Price Optimization Problems
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model
- Technical Note—Pricing Under the Nested Attraction Model with a Multistage Choice Structure
- Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds
- Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- Pricing Problems Under the Nested Logit Model with a Quality Consistency Constraint
