Invited Talks
 From Game Theory to Graph Theory: A Bilevel Journey (EURO 2019 Tutorial),
EURO 2019: 30th European Conference on Operational Research, 23rd26th June, 2019, UCD, Dublin, Ireland.
 Solving Very Large Scale Covering Location Problems using BranchandBendersCut (Invited Speaker),
IX International Workshop on Locational Analysis and Related Problems 2019, Jan 30  Feb 1, 2019,
Cádiz, Spain.
 Very Large Scale Covering Location Problems in the Design of Advanced Metering
Infrastructure (Invited Speaker),
Workshop on Smart Cities Analytics, October 12, 2018, Ivey Business School, Canada.
 From Game Theory to Graph Theory: A Bilevel Journey (EURO Plenary),
OR 2018: International Conference on Operations Research, Sept 12, 2018, Brussels, Belgium.
 Very Large Scale Covering Location Problems in the Design of Advanced Metering Infrastructure,
GERAD Seminar, NSERCHydroQuebecSchneider Electric Industrial Research Chair on Optimization for the Smart Grid, August 17, 2018, Montreal, Canada
 BranchandCut Algorithms for MixedInteger Bilevel Linear Programs (Plenary Speaker),
IWOBIP'18, 2nd International Workshop on Bilevel Programming, Inria LilleNord Europe, Lille, France, June 1822 2018.
 New BranchandCut Algorithms for MixedInteger Bilevel Linear Programs,
Séminaire Parisien d'Optimisation, Institut Henri Poincaré, June 11, 2018, Paris, France
 Exact GeneralPurpose Solvers for MixedInteger Bilevel Linear Programs,
37ème Journées Franciliennes de Recherche Opérationnelle, March 26, 2018, CNAM, Paris, France
 A dualascentbased branchandbound framework for the prizecollecting Steiner tree and related problems (Invited Speaker),
Journées Polyèdres et Optimisation Combinatoire JPOC10, June 16, 2017, University Paris 13, France
 Recent Developments on Exact Solvers for the (PrizeCollecting) Steiner Tree Problem (Invited Speaker),
22nd Belgian Mathematical Programming Workshop, LaRocheenArdennes, Belgium, April 21, 2017
 A new generalpurpose algorithm for mixedinteger bilevel linear programs,
15ème séminaire du groupe POC "Combinatorial Bilevel optimization",
LIP6, Université Pierre et Marie Curie  Paris 6, October 7, 2016
 On Benders Decomposition for Facility Location,
9ème Journée d'Automne d'Optimisation dans les Réseaux,
ROADEF GT d'Optimisation des Réseaux, Institut Henri Poincaré, Paris, December 7, 2015
 Redesigning Benders Decomposition for Large Scale Facility Location,
GOM Seminar, Universite Libre de Bruxelles, October 19, 2015
 On optimal design of charging stations for electric vehicles,
PGMO Seminar, École Polytechnique, Paris, September 17, 2015
 Exact Approaches to the Network Design Problem with Relays,
Séminaires de l'équipe AOC, Laboratoire d'informatique de Paris Nord, Paris, May 12, 2015
 MIP Approaches to the Lazy Bureaucrat and Greedy Boss Problems,
Séminaire Pôle 2 Optimisation Combinatoire, University Paris Dauphine, Paris, May 11, 2015
 The diameter constrained minimum spanning tree problem: Polyhedral study,
2. Encontro do Centro de Investigação Operacional, Portugal, Lisbon, March 28, 2015
 A New Modeling Concept for Facility Location Under Uncertainty,
Seminar of the Operations Group, Universidad Adolfo Ibanez, Santiago, Chile, March 10, 2015
 A polyhedral study of the diameter constrained minimum spanning tree problem,
Seminario conjunto ACGO y Matemáticas Discretas, Center of Mathematical Modeling, Santiago, Chile, March 6, 2015
 The Recoverable Robust Facility Location Problem,
Graz Discrete Mathematics and Optimization Seminar, TU Graz, Austria, May 13, 2014
 The Maximum Weight Connected Subgraph Problem: Applications in Bioinformatics,
The Centre for Bioinformatics, Biomarker Discovery and InformationBased Medicine (CIBM),
University of Newcastle, Australia, August 29, 2013
 The Maximum Weight Connected Subgraph Problem,
COGA Seminar, TU Berlin, November 22, 2012
 Solving 2Stage Stochastic Network Design Problems by 2Stage BranchandCut,
Seminarios CIO,
Centro de Investigacao Operacional, Faculdade de Ciencias,
Universidade de Lisboa, July 4, 2012
 Optimization Tools for Last Mile Access Networks,
Kolloquium of the Computer Science Department,
Faculty of Mathematics and Natural Sciences,
University of Cologne, May 04, 2012.
 The Recoverable Robust TwoLevel Network Design Problem,
Kolloquium Optimierung und Operations Research der Wirtschafts und Sozialwissenschaftlichen Fakultät,
der Fakultät für Informatik und der Fakultät für Mathematik, TU Dortmund, April 26, 2012.
 Solving TwoStage Stochastic Steiner Tree Problems by TwoStage BranchandCut,
Department of Decision Sciences, I2SDS Seminar,
George Washington University, January 27, 2012.
 The Generalized Regenerator Location Problem,
Decision, Operations and Information Technologies Seminar, University of Maryland, October 21, 2011.
 Dissaggregated Flow Formulation for the
SingleSource NetworkLoading Problem,
Workshop on Optical Access Networks, COGA, TU Berlin, Germany, August 1619, 2010
 OptTelNets: Algorithmische Ansätze,
Workshop on Optical Access Networks, COGA, TU Berlin, Germany, August 1619, 2010
 TwoStage Branch & Cut for TwoStage Stochastic Network Design Problems,
Algorithm Engineering Seminar, Schloss Dagstuhl, Germany, June 27  July 2, 2010
 Connected facility location in the design of telecommunication networks,
ISDSKolloquium , University of Vienna, Austria, March 19, 2007.
 Optimization in Telecommunication Networks: Multicommodity Flow, Facility Location and Steiner Tree Problems,
CIColloquium, Sonderforschungbereich Computational Intelligence ,
University of Dortmund, Germany, July 31, 2006.
Recent Presentations at International Conferences
 A New Bilevel Approach For the kvertex Cut Problem,
INFORMS Annual Meeting, October 2023, 2019, Seattle, Washington, US
 On Integer and Bilevel Formulations for the kVertex Cut Problem,
INOC 2019 (International Network Optimization Conference), 1214 June 2019, Avignon, France
 Optimal vehicle routing with autonomous devices for lastmile delivery,
VeRoLog 2019 (Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization), 25 June, 2019, Seville, Spain
 Clique Interdiction Attacks in Networks,
INFORMS Annual Meeting, Nov 47, 2018, Phoenix, AZ, US
 Benders Decomposition for Covering Location Problems,
EURO 2018, July 9, 2018, Valencia, Spain
 Decomposition Approaches to Covering Location Problems,
ISMP 2018, July 3, 2018, Bordeaux, France
 The Directed Network Design Problem with Relays,
Odysseus 2018, Seventh International Workshop on Freight Transportation and Logistics, June 8, Cagliari, Italy
 MIP Modeling of Incremental Connected Facility Location,
INFORMS Telecommunications Conference 2018, Hamburg, Germany
 Decomposition Methods for Stochastic Steiner Trees,
European Conference on Stochastic Optimization, ECSO 2017, September 22, Rome, Italy
 Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities,
Optimization 2017 Conference, September 7, 2017, Lisbon, Portugal
 New Decomposition Approaches for the TwoStage Stochastic Steiner Tree Problem,
Workshop celebrating the 60th birthday of Luis Gouveia, September 6, 2017, Lisbon, Portugal
 Clique Interdiction in the Social Network Analysis,
INOC 2017, February 28, 2017, Lisbon, Portugal
 On Clique Interdiction Problems in Graphs,
ROADEF 2017, February 23, 2017, Metz, France
 Interdiction Games and Monotonicity,
PGMO Days 2016, November 89, 2016, Paris, France
 A new exact solver for mixedinteger bilevel linear programs based in intersection cuts,
GO X, July 11, 2016 Mount Rigi, Switzerland
 Intersection Cuts for MixedInteger Bilevel Linear Programs,
EURO 2016, July 5, 2016, Poznan, Poland
 Generalized Benders Cuts for Congested Facility Location,
TRISTAN 2016, 1317 June, 2016, Aruba
 Exact Approaches for Network Design Problems with Relays,
ISCO 2016, May 16, 2016, Vietri sul Mare, Italy
 Solving MinimumCost Shared Arborescence Problems,
INFORMS Telecommunications Conference 2016, March 21, 2016, Boca Raton, FL, USA
 Solving Congested Facility Location by BranchandCut,
ROADEF 2016, February 10, 2016, Compiegne, France
 Exact Approaches to the Network Design Problem with Relays,
OR 2015, September 2, 2015, Vienna, Austria
 ILP Formulations for the Lazy Bureaucrat Problem,
EURO 2015, July 14, 2015, Glasgow, UK
 A nodebased layered graph approach for hopconstrained Steiner trees,
INOC 2015, May 20, 2015, Warsaw, Poland
 The Recoverable Robust TwoLevel Network Design Problem,
SIAM Conference on Optimization, May 21, 2014, San Diego, CA
 The Recoverable Robust Facility Location Problem,
ISCO 2014 , March 5, 2014, Lissabon, Portugal
 The Maximum Weight Connected Subgraph Problem,
EUROINFORMS Joint International Meeting 2013, July 3, 2013, Rome, Italy
 Layered graph models for hop constrained trees with multiple roots,
21st International Symposium on Mathematical Programming (ISMP 2012), August 1924, 2012, Berlin, Germany
 Capacitated Network Design with Facility Location,
25th European Conference on Operational Research (EURO 2012), July 811, 2012, Vilnius, Lithuania
 Capacitated Network Design and Facility Location,
2nd International Symposium on Combinatorial Optimization (ISCO 2012), Athens, Greece, April 1721, 2012
 On the Hop Constrained Steiner Tree Problem with
Multiple Root Nodes,
The 11th INFORMS Telecommunications Conference, Boca Raton, FL, March 1517,2012
 Solving TwoStage Network Design Problems by TwoStage BranchandCut,
The 11th INFORMS Telecommunications Conference, Boca Raton, FL, March 1517,2012
 The Two Level Network Design Problem with Secondary Hop Constraints,
Network Optimization  5th International Conference, INOC 2011, Hamburg, Germany, June 1316, 2011.
 A Two Level Network Design Problem with Transition Nodes,
15th Combinatorial Optimization Workshop, Aussois, France, January 1014, 2011.
 Solving TwoStage Stochastic Steiner Tree Problems by TwoStage BranchandCut,
Computational Management Science 2010, Vienna, Austria, July 2830, 2010
 The Generalized Regenerator Location Problem,
EURO XXIV Lisbon, Lisbon, Portugal, July 1114, 2010
 MIP Models for Connected Facility Location:
A Theoretical and Computational Study,
The 10th INFORMS Telecommunications Conference,
Montreal, Canada, May 57, 2010
 The Generalized Regenerator Location Problem,
Journées de l'Optimisation, Montréal, Canada, May 1012 2010
 A Branchandcutandprice Algorithm for Vertexbiconnectivity Augmentation,
International Symposium of Mathematical Programming (ISMP),
Chicago, Illinois, USA, August 23  28, 2009
 The Generalized Regenerator Location Problem,
International Network Optimization Conference (INOC), Pisa, Italy, April 2629, 2009
 Exact Approaches to the Singlesource Network Loading Problem,
13th Combinatorial Optimization Workshop, Aussois, France, January 1117, 2009.
 Benders Cuts for the Singlesource Network Loading Problem,
INFORMS Annual Meeting 2008,
Washington, DC, October 1215, 2008.
 Strong Formulations for 2NodeConnected Steiner Network Problems,
SIAM Conference on Optimization,
Boston, Massachusetts, May 1013, 2008.
 Solving Connected Facility Location to Provable Optimality,
Ninth INFORMS Telecommunications Conference,
University of Maryland, College Park, Washington, DC Area, March 2729, 2008.
 A Hybrid VNS for Connected Facility Location,
HM 2007, Dormund, Germany, October 89 , 2007.
 Facility Location and Steiner Trees,
Optimization 2007, Porto, Portugal, July 2225, 2007.
 Connected Facility Location: VNS, TabuSearch and BranchandCut,
Learning and Intelligent OptimizatioN (LION 2007),
Andalo (Trento), Italy, February 1218, 2007.
 Solving the PrizeCollecting Steiner Tree Problem to Optimality,
Algorithm Engineering and Experiments (ALENEX 2005) , Vancouver, British Columbia, Canada, January 22, 2005.
Other Visited Events
 17th Combinatorial Optimisation Workshop,
Aussois, France, January 711, 2013.
 12th Combinatorial Optimisation Workshop,
Aussois, France, January 711, 2008.
 11th Combinatorial Optimisation Workshop,
Aussois, France, January 712, 2007.
 7th Combinatorial Optimisation Workshop,
Aussois, France, March 915, 2003.
 International Summer School
on Metaheuristics,
Tenerife (Canary Islands), Spain, March 37, 2003.
Research Visits Abroad
 Visiting Professor at the University Adolfo Ibanez, Santiago, Chile (March 2015)
 Visiting Professor at the University of Paris, Dauphine (September 2014)
 Visiting Researcher at the TU Berlin (October 2012  Mai 2013)
 Visiting Researcher at the TU Dortmund (April 2012  September 2012)
 Visiting Assistant Professor at the University of Maryland (July 2011  March 2012)
 Other Research Visits:
 Optical Access Networks, COGA, TU Berlin (Andreas Bley), Germany, August, 2010
 The Generalized Regenerator Location Problem, Robert H. Smith School of Business, University of Maryland
(S. Raghavan) College Park, MD, May 2010
 Solving twostage stochastic Steiner tree problems by twostage branchandcut, Department of Computer Science, TU Dortmund
(Petra Mutzel), Dortmund, Germany, April 2010
 TwoLevel Network Design Problems, Department of Statistics and Operations Research, Faculty of Sciences, Centro de Investigação Operacional (Luis Gouveia), Portugal, February 2010
 Polyhedral Study of the Connected Facility Location Polytope, Department of Computer Science, TU Dortmund
(Petra Mutzel), Dortmund, Germany, May 2009
 The Generalized Regenerator Location Problem, Robert H. Smith School of Business, University of Maryland
(S. Raghavan) College Park, MD, October 2008
 The Regenerator Location Problem, Robert H. Smith School of Business, University of Maryland
(S. Raghavan) College Park, MD, April 2008
 Exact Approaches to Network Design Problems, Department of Computer Science, TU Dortmund
(Petra Mutzel), Dortmund, Germany, July 2007
 kCardinality Tree Problems , Department of Computer Science, TU Dortmund
(Petra Mutzel), Dortmund, Germany, July 2006

An evolutionary approach to the fractional prizecollecting Steiner tree problem,
University of La Laguna (Belen Melian), La Laguna, Spain, July & August 2004