Pages that link to "Item:Q3391963"
From MaRDI portal
The following pages link to A Nonparametric Approach to Multiproduct Pricing (Q3391963):
Displayed 24 items.
- Analytical solutions to the dynamic pricing problem for time-normalized revenue (Q323387) (← links)
- Efficient heuristic algorithms for maximum utility product pricing problems (Q342312) (← links)
- Approximating the revenue maximization problem with sharp demands (Q501665) (← links)
- Maximum utility product pricing models and algorithms based on reservation price (Q535296) (← links)
- On the complexity of the highway problem (Q690481) (← links)
- The rank pricing problem: models and branch-and-cut algorithms (Q1722958) (← links)
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (Q1751179) (← links)
- Approximation algorithms for the max-buying problem with limited supply (Q1755724) (← links)
- Models and algorithms for the product pricing with single-minded customers requesting bundles (Q2027005) (← links)
- Robust assortment optimization under sequential product unavailability (Q2160489) (← links)
- The rank pricing problem with ties (Q2239986) (← 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)
- On envy-free perfect matching (Q2414450) (← links)
- Stackelberg network pricing games (Q2429327) (← links)
- Dynamic pricing models for electronic business (Q2571441) (← links)
- Mixed-integer formulations for the capacitated rank pricing problem with envy (Q2669780) (← links)
- The Envy-Free Pricing Problem and Unit-Demand Markets (Q3195332) (← links)
- Technical Note—Dynamic Data-Driven Estimation of Nonparametric Choice Models (Q5031619) (← links)
- Personalized Retail Promotions Through a Directed Acyclic Graph–Based Representation of Customer Preferences (Q5080632) (← links)
- The Approximability of Assortment Optimization Under Ranking Preferences (Q5131544) (← links)
- Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization (Q5144791) (← links)
- Approximation Algorithms for Dynamic Assortment Optimization Models (Q5219727) (← links)
- Policy Optimization Using Semiparametric Models for Dynamic Pricing (Q6154014) (← links)