Pages that link to "Item:Q3144402"
From MaRDI portal
The following pages link to Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model (Q3144402):
Displayed 40 items.
- Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization (Q322574) (← links)
- A review of choice-based revenue management: theory and methods (Q724103) (← links)
- Assortment optimization under the sequential multinomial logit model (Q1631528) (← links)
- Optimizing healthcare network design under reference pricing and parameter uncertainty (Q1694841) (← links)
- A survey on risk-averse and robust revenue management (Q1694904) (← links)
- Data-driven robust optimization (Q1702776) (← links)
- Assortment planning with nested preferences: dynamic programming with distributions as states? (Q1755798) (← links)
- On upper bounds for assortment optimization under the mixture of multinomial logit models (Q1785635) (← links)
- New product launch decisions with robust optimization (Q1789598) (← links)
- Dynamic and targeted bundle pricing of two independently valued products (Q2001470) (← links)
- Optimal bundle composition in competition for continuous attributes (Q2030370) (← links)
- An exact method for assortment optimization under the nested logit model (Q2030643) (← links)
- A choice-based optimization approach for contracting in supply chains (Q2083952) (← links)
- Optimal pricing and capacity sizing for online service systems with free trials (Q2125363) (← links)
- Robust assortment optimization under sequential product unavailability (Q2160489) (← links)
- In-out algorithm for assortment planning under a ranking-based consumer choice model (Q2183213) (← links)
- Recent advances in robust optimization: an overview (Q2256312) (← links)
- A note on a tight lower bound for capacitated MNL-bandit assortment selection models (Q2294230) (← links)
- Robust assortment optimization using worst-case CVaR under the multinomial logit model (Q2294358) (← links)
- Assortment planning for vertically differentiated products under a consider-then-choose model (Q2294368) (← links)
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments (Q2300720) (← links)
- An efficient method for joint product line selection and pricing with fixed costs (Q2414119) (← links)
- The Exponomial Choice Model: A New Alternative for Assortment and Price Optimization (Q2806060) (← links)
- A Markov Chain Approximation to Choice Modeling (Q2830764) (← links)
- Assortment Optimization Under Variants of the Nested Logit Model (Q2875595) (← links)
- Optimization of an M/M/∞ Queueing System with Free Experience Service (Q2956873) (← links)
- A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice (Q3195240) (← links)
- Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings (Q3386805) (← links)
- Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model (Q4971390) (← links)
- Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences (Q4971565) (← links)
- Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models (Q5026455) (← links)
- Robust Markov Decision Processes with Data-Driven, Distance-Based Ambiguity Sets (Q5081099) (← links)
- Exact First-Choice Product Line Optimization (Q5126626) (← links)
- Approximation Algorithms for Dynamic Assortment Optimization Models (Q5219727) (← links)
- A survey of nonlinear robust optimization (Q5882395) (← links)
- Constrained multi‐location assortment optimization under the multinomial logit model (Q6057030) (← links)
- Data‐driven research in retail operations—A review (Q6072168) (← links)
- Optimal pricing of online products based on customer anchoring‐adjustment psychology (Q6082285) (← links)
- Multi-plant manufacturing assortment planning in the presence of transshipments (Q6113449) (← links)
- Robust maximum capture facility location under random utility maximization models (Q6113461) (← links)