Technical Note—Assortment Optimization with Small Consideration Sets
From MaRDI portal
Publication:5129194
DOI10.1287/opre.2018.1803zbMath1444.90011OpenAlexW2953601795WikidataQ127549171 ScholiaQ127549171MaRDI QIDQ5129194
Jacob B. Feldman, Alice Paul, Huseyin Topaloglu
Publication date: 26 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2018.1803
Related Items (5)
Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection ⋮ Data‐driven research in retail operations—A review ⋮ Multi-plant manufacturing assortment planning in the presence of transshipments ⋮ Capacitated strategic assortment planning under explicit demand substitution ⋮ Assortment optimization under the multinomial logit model with product synergies
Cites Work
- Unnamed Item
- Unnamed Item
- A branch-and-cut algorithm for the latent-class logit assortment problem
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Some APX-completeness results for cubic graphs
- A greedy algorithm for the two-level nested logit model
- Capacitated assortment and price optimization under the multinomial logit model
- A Markov Chain Approximation to Choice Modeling
- Assortment Optimization Under Variants of the Nested Logit Model
- New Formulations for Choice Network Revenue Management
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- Discrete Choice Methods with Simulation
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
- 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
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Inventory Competition Under Dynamic Consumer Choice
- Vertex packings: Structural properties and algorithms
- Derandomizing Approximation Algorithms Based on Semidefinite Programming
- Revenue Management Under the Markov Chain Choice Model
- On a combinatorial game
This page was built for publication: Technical Note—Assortment Optimization with Small Consideration Sets
