Constrained assortment optimization under the paired combinatorial logit model
From MaRDI portal
Publication:5080643
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
Cites work
- scientific article; zbMATH DE number 1342117 (Why is no real title available?)
- scientific article; zbMATH DE number 2086914 (Why is no real title available?)
- A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts
- A Markov chain approximation to choice modeling
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- Assortment optimization under the paired combinatorial logit model
- Assortment optimization under variants of the nested logit model
- Capacity constraints across nests in assortment optimization under the nested logit model
- Combined gravity model trip distribution and paired combinatorial logit stochastic user equilibrium problem
- Computation and application of the paired combinatorial logit stochastic user equilibrium problem
- Constrained submodular maximization via a nonsymmetric technique
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- On the power of unique 2-prover 1-round games
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Optimal pricing of correlated product options under the paired combinatorial logit model
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Some optimal inapproximability results
Cited in
(15)- Technical note: Assortment optimization with small consideration sets
- scientific article; zbMATH DE number 1927296 (Why is no real title available?)
- On the tightness of an LP relaxation for rational optimization and its applications
- An exact method for (constrained) assortment optimization problems with product costs
- Tractable approximations for assortment planning with product costs
- Assortment optimization under the paired combinatorial logit model
- Technical note -- Capacitated assortment optimization: hardness and approximation
- Assortment optimization under the multinomial logit model with product synergies
- Combinatorial assortment optimization
- Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information
- Optimizing revenue while showing relevant assortments at scale
- Joint Assortment Optimization and Customization Under a Mixture of Multinomial Logit Models: On the Value of Personalized Assortments
- Assortment optimization: a systematic literature review
- Technical Note—New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model
- Constrained multi‐location assortment optimization under the multinomial logit model
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)
