Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds
From MaRDI portal
Publication:3466778
DOI10.1287/ijoc.2014.0629zbMath1329.91088OpenAlexW1993441338MaRDI QIDQ3466778
Huseyin Topaloglu, Paat Rusmevichientong, W. Zachary Rayfield
Publication date: 25 January 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/389426aae3c84979131168979a470f7fd8152ed7
Related Items (12)
Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model ⋮ Technical Note—Pricing Under the Nested Attraction Model with a Multistage Choice Structure ⋮ Technical Note—Optimal Pricing Under Multiple-Discrete Customer Choices and Diminishing Return of Consumption ⋮ Pricing optimization and competition under the linear nested stochastic choice model ⋮ Assortment optimization with position effects under the nested logit model ⋮ Preference based scheduling in a healthcare provider network ⋮ Optimal Pricing Under Diffusion-Choice Models ⋮ Technical Note—Multiproduct Pricing Under the Generalized Extreme Value Models with Homogeneous Price Sensitivity Parameters ⋮ Optimal Pricing for a Multinomial Logit Choice Model with Network Effects ⋮ A review of choice-based revenue management: theory and methods ⋮ Capacitated assortment and price optimization under the multilevel nested logit model ⋮ Capacitated assortment and price optimization under the nested logit model
Cites Work
- A branch-and-cut algorithm for the latent-class logit assortment problem
- On the compatibility of nested logit models with utility maximization
- A PTAS for capacitated sum-of-ratios optimization
- Capacitated assortment and price optimization under the multinomial logit model
- Assortment Optimization Under Variants of the Nested Logit Model
- Multiproduct Price Optimization and Competition Under the Nested Logit Model with Product-Differentiated Price Sensitivities
- 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
- Optimizing Multinomial Logit Profit Functions
- A refined deterministic linear program for the network revenue management problem with customer choice behavior
This page was built for publication: Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds
