Gerardo Berbeglia NSERC Postdoctoral Fellow Department of Mathematics and Statistics McGill University Email: gerardo.berbegliaxx[at]xxhec.ca Education Ph.D., HEC Montréal (Operations Research) 2004-2009 (Recipient of the Cecil Graham Award 2010) Thesis title: "Complexity analyses and algorithms for pickup and delivery problems" (download) Advisors: Jean-François Cordeau and Gilbert Laporte M.Sc., University of Buenos Aires (Computer Science) 2001-2003 Thesis title: "Simulation of satellite solar powered systems" Advisors: Julio Durán and Elena Godfrin B.Sc., University of Buenos Aires (Computer Science) 1998-2001

Published and accepted journal publications

• G. Berbeglia, J.-F. Cordeau and G. Laporte A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS Journal on Computing, 2011 (forthcoming).
• G. Berbeglia, G. Pesant and L.-M. Rousseau Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Science, in press. (pdf)
• G. Berbeglia. The counting complexity of a simple scheduling problem. Operations Research Letters, 37:365-367, 2010. (pdf)
• G. Berbeglia, J.-F. Cordeau and G. Laporte. Dynamic Pickup and Delivery Problems. European Journal of Operational Research, 202:8-15, 2010. (pdf)
• G. Berbeglia and G. Hahn. Counting feasible solutions of the Traveling Salesman Problem with Pickups and Deliveries is #P-complete. Discrete Applied Mathematics, 157:2541-2547, 2009. (pdf)
• G. Berbeglia, J.-F. Cordeau, I. Gribkovskaia and G. Laporte. Static Pickup and Delivery Problems: A Classification Scheme and survey. TOP, 15:1-31, 2007.
• G. Berbeglia, D. Slezak, J. Durán and E. Godfrin, Simulación del sistema eléctrico de la misión satelital SAOCOM, Avances en Energías Renovables y Medio Ambiente, vol 7, 32-35, 2003.

Submitted journal publications

• G. Berbeglia, G. Pesant and L.-M. Rousseau Feasibility of the pickup and delivery problem with fixed partial routes: A complexity analysis. Submitted to Transportation Science, 2010 (under second review).

Selected presentations

• G. Berbeglia, Complexity Analyses and Algorithms for Pickup and Delivery Problems. Canadian Applied and Industrial Mathematics Annual Meeting, July 17-20, 2010, St-John's, Canada (Prize Plenary Speaker).
• G. Berbeglia, J.-F. Cordeau, G. Laporte, A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. ALIO/INFORMS Joint International Meeting, June 6-9, 2010, Buenos Aires, Argentina.
• G. Berbeglia, G. Pesant, L.-M. Rousseau, Checking the feasibility of the Dial-a-Ride Problem Using Constraint Programming. Optimisation Days 2008, May 4-6, 2009, Montreal, Canada.
• G. Berbeglia, G. Pesant, L.-M. Rousseau, Complexity analysis and algorithms for some dial-a-ride relaxations. VI ALIO/EURO Workshop on Applied Combinatorial Optimization, December 15-17,2008, Buenos Aires, Argentina.