Technical note -- Capacitated assortment optimization: hardness and approximation
From MaRDI portal
Recommendations
- Technical note: Capacitated assortment optimization under the multinomial logit model with nested consideration sets
- Capacity constraints across nests in assortment optimization under the nested logit model
- Capacitated assortment and price optimization under the nested logit model
- Assortment optimization under the paired combinatorial logit model
- Constrained assortment optimization under the paired combinatorial logit model
Cites work
- A branch-and-cut algorithm for the latent-class logit assortment problem
- A column generation algorithm for choice-based network revenue management
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- A Markov chain approximation to choice modeling
- A PTAS for capacitated sum-of-ratios optimization
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Assortment optimization under variants of the nested logit model
- Capacitated assortment and price optimization under the multilevel nested logit model
- Capacitated assortment and price optimization under the nested logit model
- Capacity constraints across nests in assortment optimization under the nested logit model
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- scientific article; zbMATH DE number 3152611 (Why is no real title available?)
- Reducibility among combinatorial problems
- Revenue Management for Parallel Flights with Customer-Choice Behavior
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Revenue management under the Markov chain choice model
- The d-level nested logit model: assortment and price optimization problems
- The approximability of assortment optimization under ranking preferences
Cited in
(24)- Capacitated assortment and price optimization for customers with disjoint consideration sets
- On upper bounds for assortment optimization under the mixture of multinomial logit models
- Assortment optimization using an attraction model in an omnichannel environment
- Combinatorial assortment optimization
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Capacity constraints across nests in assortment optimization under the nested logit model
- Technical note: Capacitated assortment optimization under the multinomial logit model with nested consideration sets
- Technical note: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model
- Technical note -- Approximation schemes for capacity-constrained assortment optimization under the nested logit model
- Constrained assortment optimization under the paired combinatorial logit model
- Technical note: Assortment optimization with small consideration sets
- Assortment optimization under the paired combinatorial logit model
- Note on the applicability of the VCG mechanism to capacitated assignment problems and extensions
- One-stage product-line design heuristics: an empirical comparison
- Joint promotional effort and assortment optimization under the multinomial logit model
- Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings
- An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming
- Assortment optimization under the multinomial logit choice model with product-specific capacities
- Advertising meets assortment planning: joint advertising and assortment optimization under multinomial logit model
- Assortment optimization with visibility constraints
- Pricing and assortment optimization under logit-based choice models with tree-structured consideration sets
- Constrained assortment optimization under the mixed-logit model: approximation schemes and outer approximation approaches
- Assortment optimization with visibility constraints
- A PTAS for capacitated sum-of-ratios optimization
This page was built for publication: Technical note -- Capacitated assortment optimization: hardness and approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080651)
