Constrained Assortment Optimization Under the Paired Combinatorial Logit Model
From MaRDI portal
Publication:5080643
DOI10.1287/opre.2021.2188zbMath1493.90126OpenAlexW4200158701MaRDI QIDQ5080643
Joseph S. Kwon, Viswanath Nagarajan, Adetee Sharma, Rohan Ghuge
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
Semidefinite programming (90C22) Applications of mathematical programming (90C90) Linear programming (90C05)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts
- A Markov Chain Approximation to Choice Modeling
- Assortment Optimization Under Variants of the Nested Logit Model
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model
- On the power of unique 2-prover 1-round games
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Optimal Pricing of Correlated Product Options Under the Paired Combinatorial Logit Model
- Constrained Submodular Maximization via a Nonsymmetric Technique
- Assortment Optimization Under the Paired Combinatorial Logit Model
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- Some optimal inapproximability results
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
This page was built for publication: Constrained Assortment Optimization Under the Paired Combinatorial Logit Model
