Pages that link to "Item:Q2875595"
From MaRDI portal
The following pages link to Assortment Optimization Under Variants of the Nested Logit Model (Q2875595):
Displaying 50 items.
- Assortment optimization under a multinomial logit model with position bias and social influence (Q262450) (← links)
- A tractable discrete fractional programming: application to constrained assortment optimization (Q721924) (← links)
- A review of choice-based revenue management: theory and methods (Q724103) (← links)
- Capacitated assortment and price optimization under the nested logit model (Q785637) (← links)
- Assortment optimization under the sequential multinomial logit model (Q1631528) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model (Q1680972) (← links)
- Assortment planning with nested preferences: dynamic programming with distributions as states? (Q1755798) (← links)
- A greedy algorithm for the two-level nested logit model (Q1785243) (← links)
- Assortment optimization over time (Q1785447) (← links)
- Capacitated assortment and price optimization under the multinomial logit model (Q1939696) (← links)
- An exact method for assortment optimization under the nested logit model (Q2030643) (← links)
- Anticipative dynamic slotting for attended home deliveries (Q2068855) (← links)
- Parameterized approximations for the two-sided assortment optimization (Q2157918) (← links)
- Robust assortment optimization under sequential product unavailability (Q2160489) (← links)
- Combinatorial assortment optimization (Q2190396) (← links)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
- Parameter identification in Markov chain choice models (Q2290689) (← links)
- Robust assortment optimization using worst-case CVaR under the multinomial logit model (Q2294358) (← links)
- An efficient method for joint product line selection and pricing with fixed costs (Q2414119) (← links)
- On substitutability and complementarity in discrete choice models (Q2417069) (← links)
- Product sequencing and pricing under cascade browse model (Q2661544) (← links)
- An optimal stocking problem to minimize the expected time to sellout (Q2661592) (← links)
- Assortment optimization with repeated exposures and product-dependent patience cost (Q2670462) (← links)
- Product line optimization with multiples sites (Q2676378) (← 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 the Multinomial Logit Model with Sequential Offerings (Q3386805) (← links)
- Dynamic Assortment Personalization in High Dimensions (Q3387950) (← links)
- The <i>d</i>-Level Nested Logit Model: Assortment and Price Optimization Problems (Q3453331) (← links)
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model (Q3465583) (← links)
- Technical Note—Pricing Under the Nested Attraction Model with a Multistage Choice Structure (Q3465586) (← links)
- Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds (Q3466778) (← links)
- The Multiproduct Newsvendor Problem with Customer Choice (Q4969313) (← links)
- Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model (Q4971390) (← links)
- Customer Choice Models vs. Machine Learning: Finding Optimal Product Displays on Alibaba (Q5031014) (← links)
- Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice (Q5031618) (← links)
- Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection (Q5031641) (← links)
- Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model (Q5058046) (← links)
- Constrained Assortment Optimization Under the Paired Combinatorial Logit Model (Q5080643) (← links)
- Technical Note—Capacitated Assortment Optimization: Hardness and Approximation (Q5080651) (← links)
- Technical Note—Optimal Pricing Under Multiple-Discrete Customer Choices and Diminishing Return of Consumption (Q5080652) (← links)
- Tractable Approximations for Assortment Planning with Product Costs (Q5126613) (← links)
- Exact First-Choice Product Line Optimization (Q5126626) (← links)
- Technical Note—Assortment Optimization with Small Consideration Sets (Q5129194) (← links)
- MNL-Bandit: A Dynamic Learning Approach to Assortment Selection (Q5129205) (← links)
- Optimal Pricing Under Diffusion-Choice Models (Q5130487) (← links)
- Approximation Algorithms for Product Framing and Pricing (Q5130488) (← links)
- Dynamic Nonlinear Pricing of Inventories over Finite Sales Horizons (Q5130498) (← links)
- Assortment Optimization Under the Paired Combinatorial Logit Model (Q5130506) (← links)