Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model
From MaRDI portal
Publication:3465583
DOI10.1287/opre.2015.1383zbMath1329.90087OpenAlexW1848196498MaRDI QIDQ3465583
Huseyin Topaloglu, Jacob B. Feldman
Publication date: 22 January 2016
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b5f99e38943ddd9e1d493593129695357dad8ca7
Related Items (17)
Technical Note—Consumer Choice and Market Expansion: Modeling, Optimization, and Estimation ⋮ 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—Capacitated Assortment Optimization: Hardness and Approximation ⋮ The non-Markovian nature of nested logit choice ⋮ Constrained multi‐location assortment optimization under the multinomial logit model ⋮ Assortment optimization with position effects under the nested logit model ⋮ Multi-plant manufacturing assortment planning in the presence of transshipments ⋮ Price optimization under the extended nested logit model ⋮ Technical Note—Assortment Optimization with Small Consideration Sets ⋮ Assortment Optimization Under the Paired Combinatorial Logit Model ⋮ Capacitated strategic assortment planning under explicit demand substitution ⋮ Assortment planning with nested preferences: dynamic programming with distributions as states? ⋮ A tractable discrete fractional programming: application to constrained assortment optimization ⋮ A review of choice-based revenue management: theory and methods ⋮ An exact method for assortment optimization under the nested logit model ⋮ Capacitated assortment and price optimization under the nested logit model
Cites Work
- Unnamed Item
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- A PTAS for capacitated sum-of-ratios optimization
- A greedy algorithm for the two-level nested logit model
- Capacitated assortment and price optimization under the multinomial logit model
- Approximating a class of combinatorial problems with rational objective function
- Assortment Optimization Under Variants of the Nested Logit Model
- A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- The Multiple-Choice Knapsack Problem
- Approximation algorithms for combinatorial fractional programming problems
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
This page was built for publication: Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model
