Pages that link to "Item:Q3098330"
From MaRDI portal
The following pages link to Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint (Q3098330):
Displaying 50 items.
- Assortment optimization under a multinomial logit model with position bias and social influence (Q262450) (← links)
- Logit network pricing (Q336811) (← links)
- Willingness-to-pay estimation with choice-based conjoint analysis: addressing extreme response behavior with individually adapted designs (Q439688) (← links)
- A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669) (← 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)
- Solving utility-maximization selection problems with multinomial logit demand: is the first-choice model a good approximation? (Q827131) (← links)
- A PTAS for capacitated sum-of-ratios optimization (Q833588) (← links)
- Assortment optimization under the sequential multinomial logit model (Q1631528) (← links)
- Retail store operations: literature review and research directions (Q1681258) (← links)
- Capacitated assortment and price optimization for customers with disjoint consideration sets (Q1728178) (← links)
- Assortment planning with nested preferences: dynamic programming with distributions as states? (Q1755798) (← links)
- Assortment optimization over time (Q1785447) (← links)
- On the sum-product ratio problem and its applications (Q1790208) (← links)
- Capacitated assortment and price optimization under the multinomial logit model (Q1939696) (← links)
- Quality and pricing decisions in production/inventory systems (Q1991121) (← links)
- Optimal bundle composition in competition for continuous attributes (Q2030370) (← links)
- Purchase preferences-based air passenger choice behavior analysis from sales transaction data (Q2079864) (← links)
- Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
- Optimizing revenue while showing relevant assortments at scale (Q2116864) (← links)
- Assortment optimization in omni-channel retailing (Q2140145) (← links)
- Robust assortment optimization under sequential product unavailability (Q2160489) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Combinatorial assortment optimization (Q2190396) (← links)
- Capacitated strategic assortment planning under explicit demand substitution (Q2240061) (← links)
- Discovering heterogeneous consumer groups from sales transaction data (Q2272326) (← links)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
- A note on a tight lower bound for capacitated MNL-bandit assortment selection models (Q2294230) (← 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)
- An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers (Q2669739) (← links)
- Assortment optimization with repeated exposures and product-dependent patience cost (Q2670462) (← links)
- The Exponomial Choice Model: A New Alternative for Assortment and Price Optimization (Q2806060) (← links)
- Assortment Optimization Under Variants of the Nested Logit Model (Q2875595) (← 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)
- Dynamic Assortment Personalization in High Dimensions (Q3387950) (← links)
- Multi-Product Price and Assortment Competition (Q3450461) (← links)
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model (Q3465583) (← links)
- Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds (Q3466778) (← links)
- Learning to Optimize via Information-Directed Sampling (Q4969321) (← 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)
- Customer Choice Models vs. Machine Learning: Finding Optimal Product Displays on Alibaba (Q5031014) (← links)
- Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection (Q5031641) (← links)
- A regret lower bound for assortment optimization under the capacitated MNL model with arbitrary revenue parameters (Q5051208) (← links)
- Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets (Q5058044) (← links)
- Constrained Assortment Optimization Under the Paired Combinatorial Logit Model (Q5080643) (← links)
