Constrained assortment optimization under the paired combinatorial logit model
From MaRDI portal
Publication:5080643
DOI10.1287/OPRE.2021.2188zbMATH Open1493.90126OpenAlexW4200158701MaRDI QIDQ5080643FDOQ5080643
Authors: Rohan Ghuge, Joseph S. Kwon, Viswanath Nagarajan, Adetee Sharma 
Publication date: 31 May 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2021.2188
Recommendations
- Assortment optimization under the paired combinatorial logit model
- Combinatorial assortment optimization
- Capacity constraints across nests in assortment optimization under the nested logit model
- Technical note -- Capacitated assortment optimization: hardness and approximation
- Assortment optimization under variants of the nested logit model
Linear programming (90C05) Applications of mathematical programming (90C90) Semidefinite programming (90C22)
Cites Work
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- Combined gravity model trip distribution and paired combinatorial logit stochastic user equilibrium problem
- Assortment optimization under variants of the nested logit model
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Computation and application of the paired combinatorial logit stochastic user equilibrium problem
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Title not available (Why is that?)
- Some optimal inapproximability results
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- On the power of unique 2-prover 1-round games
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- Title not available (Why is that?)
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- A Markov chain approximation to choice modeling
- Capacity constraints across nests in assortment optimization under the nested logit model
- A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts
- Assortment optimization under the paired combinatorial logit model
- Constrained submodular maximization via a nonsymmetric technique
- Optimal pricing of correlated product options under the paired combinatorial logit model
Cited In (15)
- Assortment optimization under the paired combinatorial logit model
- Technical note -- Capacitated assortment optimization: hardness and approximation
- Technical note: Assortment optimization with small consideration sets
- An exact method for (constrained) assortment optimization problems with product costs
- Tractable approximations for assortment planning with product costs
- Title not available (Why is that?)
- Assortment optimization under the multinomial logit model with product synergies
- Joint Assortment Optimization and Customization Under a Mixture of Multinomial Logit Models: On the Value of Personalized Assortments
- Technical Note—New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model
- Constrained multi‐location assortment optimization under the multinomial logit model
- On the tightness of an LP relaxation for rational optimization and its applications
- Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information
- Combinatorial assortment optimization
- Assortment optimization: a systematic literature review
- Optimizing revenue while showing relevant assortments at scale
This page was built for publication: Constrained assortment optimization under the paired combinatorial logit model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080643)
