The following pages link to Gerardo Berbeglia (Q262447):
Displaying 17 items.
- Assortment optimization under a multinomial logit model with position bias and social influence (Q262450) (← links)
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292) (← links)
- The counting complexity of a simple scheduling problem (Q1038110) (← links)
- Dynamic pickup and delivery problems (Q1038370) (← links)
- Tight bounds on the relative performances of pricing mechanisms in storable good markets (Q1617678) (← links)
- Assortment optimization under the sequential multinomial logit model (Q1631528) (← links)
- Bargaining mechanisms for one-way games (Q1651808) (← links)
- Pricing policies for selling indivisible storable goods to strategic consumers (Q1730708) (← links)
- Popularity signals in trial-offer markets with social influence and position bias (Q1754150) (← links)
- Discrete choice models based on random walks (Q1785753) (← links)
- Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets (Q2067499) (← links)
- Market segmentation in online platforms (Q2242393) (← links)
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments (Q2300720) (← links)
- The finite horizon, undiscounted, durable goods monopoly problem with finitely many consumers (Q2425152) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem (Q2815449) (← links)
- Approximate Resolution of Stochastic Choice-based Discrete Planning (Q6745109) (← links)
