default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerardo Berbeglia
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Guillermo Gallego
, Gerardo Berbeglia:
Bounds and Heuristics for Multiproduct Pricing. Manag. Sci. 70(6): 4132-4144 (2024)- 2022
- [j17]Gerardo Berbeglia, Agustín Garassino, Gustavo J. Vulcano:
A Comparative Empirical Study of Discrete Choice Models in Retail Operations. Manag. Sci. 68(6): 4005-4023 (2022) - 2021
- [j16]Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta:
Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets. Discret. Optim. 42: 100671 (2021) - [j15]Franco Berbeglia, Gerardo Berbeglia, Pascal Van Hentenryck:
Market segmentation in online platforms. Eur. J. Oper. Res. 295(3): 1025-1041 (2021) - 2020
- [j14]Gerardo Berbeglia, Gwenaël Joret:
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments. Algorithmica 82(4): 681-720 (2020) - [i15]Felipe Maldonado, Gerardo Berbeglia, Pascal Van Hentenryck:
Pricing under a multinomial logit model with non linear network effects. CoRR abs/2005.03352 (2020)
2010 – 2019
- 2019
- [j13]Gerardo Berbeglia, Gautam Rayaprolu, Adrian Vetta:
Pricing policies for selling indivisible storable goods to strategic consumers. Ann. Oper. Res. 274(1-2): 131-154 (2019) - [j12]Álvaro Flores, Gerardo Berbeglia, Pascal Van Hentenryck:
Assortment optimization under the Sequential Multinomial Logit Model. Eur. J. Oper. Res. 273(3): 1052-1064 (2019) - 2018
- [j11]Felipe Maldonado, Pascal Van Hentenryck, Gerardo Berbeglia, Franco Berbeglia:
Popularity signals in trial-offer markets with social influence and position bias. Eur. J. Oper. Res. 266(2): 775-793 (2018) - [c9]Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta:
Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets. SAGT 2018: 267-271 - [i14]Gerardo Berbeglia:
The generalized stochastic preference choice model. CoRR abs/1803.04244 (2018) - 2017
- [c8]Gerardo Berbeglia, Gwenaël Joret:
Assortment Optimisation under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments. EC 2017: 345-346 - [c7]Andrés Abeliuk, Gerardo Berbeglia, Pascal Van Hentenryck, Tad Hogg, Kristina Lerman:
Taming the Unpredictability of Cultural Markets with Social Influence. WWW 2017: 745-754 - [i13]Álvaro Flores, Gerardo Berbeglia, Pascal Van Hentenryck:
Assortment Optimization under the General Luce Model. CoRR abs/1706.08599 (2017) - [i12]Álvaro Flores, Gerardo Berbeglia, Pascal Van Hentenryck:
Assortment Optimization under the Sequential Multinomial Logit Model. CoRR abs/1707.02572 (2017) - 2016
- [j10]Andrés Abeliuk, Gerardo Berbeglia, Manuel Cebrián, Pascal Van Hentenryck:
Assortment optimization under a multinomial logit model with position bias and social influence. 4OR 14(1): 57-75 (2016) - [j9]Gerardo Berbeglia:
Discrete choice models based on random walks. Oper. Res. Lett. 44(2): 234-237 (2016) - [c6]Pascal Van Hentenryck, Andrés Abeliuk, Franco Berbeglia, Felipe Maldonado, Gerardo Berbeglia:
Aligning Popularity and Quality in Online Cultural Markets. ICWSM 2016: 398-407 - [c5]Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh:
Interdependent Scheduling Games. IJCAI 2016: 2-9 - [c4]Andrés Abeliuk, Gerardo Berbeglia, Felipe Maldonado, Pascal Van Hentenryck:
Asymptotic Optimality of Myopic Optimization in Trial-Offer Markets with Social Influence. IJCAI 2016: 2458-2464 - [i11]Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh:
Interdependent Scheduling Games. CoRR abs/1605.09497 (2016) - [i10]Gerardo Berbeglia, Gwenaël Joret:
Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments. CoRR abs/1606.01371 (2016) - [i9]Pascal Van Hentenryck, Álvaro Flores, Gerardo Berbeglia:
Trial-Offer Markets with Continuation. CoRR abs/1610.01929 (2016) - 2015
- [j8]Andrés Abeliuk, Gerardo Berbeglia, Pascal Van Hentenryck:
Bargaining Mechanisms for One-Way Games. Games 6(3): 347-367 (2015) - [c3]Andrés Abeliuk, Gerardo Berbeglia, Pascal Van Hentenryck:
A Bargaining Mechanism for One-Way Games. IJCAI 2015: 440-446 - [i8]Pascal Van Hentenryck, Andrés Abeliuk, Franco Berbeglia, Gerardo Berbeglia:
On the Optimality and Predictability of Cultural Markets with Social Influence. CoRR abs/1505.02469 (2015) - [i7]Andrés Abeliuk, Gerardo Berbeglia, Pascal Van Hentenryck:
Bargaining Mechanisms for One-Way Games. CoRR abs/1507.07152 (2015) - [i6]Gerardo Berbeglia, Gautam Rayaprolu, Adrian Vetta:
The Storable Good Monopoly Problem with Indivisible Demand. CoRR abs/1509.07330 (2015) - [i5]Franco Berbeglia, Gerardo Berbeglia, Pascal Van Hentenryck:
The Benefits of Segmentation in Trial-Offer Markets with Social Influence and Position Bias. CoRR abs/1511.00750 (2015) - [i4]Felipe Maldonado, Pascal Van Hentenryck, Gerardo Berbeglia, Franco Berbeglia:
Popularity Signals in Trial-Offer Markets. CoRR abs/1512.07251 (2015) - 2014
- [j7]Gerardo Berbeglia, Peter Sloan, Adrian Vetta:
Pricing mechanisms for a durable good monopolist. SIGMETRICS Perform. Evaluation Rev. 41(4): 50 (2014) - [c2]Andrés Abeliuk, Gerardo Berbeglia, Pascal Van Hentenryck:
One-way games. AAMAS 2014: 1519-1520 - [c1]Gerardo Berbeglia, Peter Sloan, Adrian Vetta:
Bounds on the Profitability of a Durable Good Monopolist. WINE 2014: 292-293 - [i3]Andrés Abeliuk, Gerardo Berbeglia, Manuel Cebrián, Pascal Van Hentenryck:
Measuring and Optimizing Cultural Markets. CoRR abs/1408.1542 (2014) - [i2]Gerardo Berbeglia, Peter Sloan, Adrian Vetta:
Bounds on the Profitability of a Durable Good Monopolist. CoRR abs/1409.7979 (2014) - [i1]Andrés Abeliuk, Gerardo Berbeglia, Manuel Cebrián, Pascal Van Hentenryck:
Optimizing Expected Utility in a Multinomial Logit Model with Position Bias and Social Influence. CoRR abs/1411.0279 (2014) - 2012
- [j6]Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte:
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem. INFORMS J. Comput. 24(3): 343-355 (2012) - [j5]Gerardo Berbeglia, Gilles Pesant, Louis-Martin Rousseau:
Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis. Transp. Sci. 46(3): 359-373 (2012) - 2011
- [j4]Gerardo Berbeglia, Gilles Pesant, Louis-Martin Rousseau:
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming. Transp. Sci. 45(3): 399-412 (2011) - 2010
- [j3]Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte:
Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1): 8-15 (2010)
2000 – 2009
- 2009
- [j2]Gerardo Berbeglia, Gena Hahn:
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete. Discret. Appl. Math. 157(11): 2541-2547 (2009) - [j1]Gerardo Berbeglia:
The counting complexity of a simple scheduling problem. Oper. Res. Lett. 37(5): 365-367 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
