Mixed Integer Bilevel Optimization
Plenary/Keynote Talk, SIAM Conference on Optimization (OP21),
Talks and Presentations
Plenary/Keynote Talks
Panel Discussion Real-World Optimisation Models: Successes and Pitfalls
Plenary/Keynote Talk, Beale Lecture, The OR Society,
New integer and Bilevel Formulations for the k-Vertex Cut Problem
Plenary/Keynote Talk, 5th AIRO Young Workshop,
Casting Light on the Hidden Bilevel Structure of the Capacitated Vertex Separator Problem
Plenary/Keynote Talk, Mixed Integer Programming Workshop 2020 Online Edition (MIP2020),
From Game Theory to Graph Theory: A Bilevel Journey
Plenary/Keynote Talk, EURO 2019: 30th European Conference on Operational Research, UCD, Dublin, Ireland
Solving Very Large Scale Covering Location Problems using Branch-and-Benders-Cut
Plenary/Keynote Talk, IX International Workshop on Locational Analysis and Related Problems 2019, Cádiz, Spain
From Game Theory to Graph Theory: A Bilevel Journey
Plenary/Keynote Talk, OR 2018: International Conference on Operations Research, Brussels, Belgium
Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem
Plenary/Keynote Talk, 22nd Belgian Mathematical Programming Workshop, La-Roche-en-Ardennes, Belgium
Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear Programs
Plenary/Keynote Talk, 2nd International Workshop on Bilevel Programming, Inria Lille-Nord Europe, Lille, France
Other Invited Talks, Seminars and Tutorials
Branch-and-Cut Solvers for Mixed-Integer Bilevel Linear Programs
Talk, Autumn School on Bilevel Optimization, Uni Trier, Germany
New integer and Bilevel Formulations for the k-Vertex Cut Problem
Talk, 22ème séminaire du groupe POC (online),
Branch-and-Benders-cut algorithms: modern implementations of Benders Decomposition
Talk, 9th Winter School on Network Optimization, Estoril, Portugal
Very Large Scale Covering Location Problems in the Design of Advanced Metering Infrastructure
Talk, Workshop on Smart Cities Analytics, Ivey Business School, Canada
A new branch-and-cut algorithm for interdiction problems with monotonicity
Talk, USC Center for Artificial Intelligence in Society,
Very Large Scale Covering Location Problems in the Design of Advanced Metering Infrastructure
Talk, GERAD Seminar, Montreal, Canada
New Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear Programs
Talk, Séminaire Parisien d'Optimisation, Institut Henri Poincaré, Paris, France
Exact General-Purpose Solvers for Mixed-Integer Bilevel Linear Programs
Talk, 37ème Journées Franciliennes de Recherche Opérationnelle, CNAM, Paris, France
On Benders Decomposition for Facility Location
Talk, 9ème Journée d'Automne d'Optimisation dans les Réseaux, ROADEF GT d'Optimisation des Réseaux, Institut Henri Poincaré, Paris
A dual-ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
Invited Speaker, Journées Polyèdres et Optimisation Combinatoire JPOC10, University Paris 13, France
A new general-purpose algorithm for mixed-integer bilevel linear programs
Talk, 15ème séminaire du groupe POC - Combinatorial Bi-level optimization, Université Pierre et Marie Curie, Paris
Redesigning Benders Decomposition for Large Scale Facility Location
Talk, GOM Seminar, Universite Libre de Bruxelles
On optimal design of charging stations for electric vehicles
Talk, PGMO Seminar, École Polytechnique, Paris
Exact Approaches to the Network Design Problem with Relays
Talk, Séminaires de l'équipe AOC, Laboratoire d'informatique de Paris Nord, Paris
MIP Approaches to the Lazy Bureaucrat and Greedy Boss Problems
Talk, Séminaire Pôle 2 Optimisation Combinatoire, University Paris Dauphine, Paris
A polyhedral study of the diameter constrained minimum spanning tree problem
Talk, Seminario conjunto ACGO y Matemáticas Discretas, Center of Mathematical Modeling, Santiago, Chile
The diameter constrained minimum spanning tree problem: Polyhedral study
Talk, Encontro do Centro de Investigação Operacional, Portugal, Lisbon
A New Modeling Concept for Facility Location Under Uncertainty
Seminar, Operations Group, Universidad Adolfo Ibanez, Santiago, Chile
The Recoverable Robust Facility Location Problem
Talk, Graz Discrete Mathematics and Optimization Seminar, TU Graz, Austria
The Maximum Weight Connected Subgraph Problem: Applications in Bioinformatics
Talk, The Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine, University of Newcastle, Australia
The Maximum Weight Connected Subgraph Problem
Talk, COGA Seminar, TU Berlin
Solving 2-Stage Stochastic Network Design Problems by 2-Stage Branch-and-Cut
Talk, Seminarios CIO, Universidade de Lisboa
The Recoverable Robust Two-Level Network Design Problem
Talk, Kolloquium Optimierung und Operations Research, TU Dortmund
Optimization Tools for Last Mile Access Networks
Talk, Kolloquium of the Computer Science Department, Faculty of Mathematics and Natural Sciences, University of Cologne
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Talk, Department of Decision Sciences, George Washington University,
The Generalized Regenerator Location Problem
Talk, Decision, Operations and Information Technologies Seminar, University of Maryland
OptTelNets: Algorithmische Ansätze
Talk, Workshop on Optical Access Networks, COGA, TU Berlin, Germany
Dissaggregated Flow Formulation for the Single-Source Network-Loading Problem
Talk, Workshop on Optical Access Networks, COGA, TU Berlin, Germany
Two-Stage Branch & Cut for Two-Stage Stochastic Network Design Problems
Talk, Algorithm Engineering Seminar, Schloss Dagstuhl, Germany
Connected facility location in the design of telecommunication networks
Talk, ISDS-Kolloquium, University of Vienna, Austria
Optimization in Telecommunication Networks: Multicommodity Flow, Facility Location and Steiner Tree Problems
Talk, CI-Colloquium, Sonderforschungbereich Computational Intelligence, University of Dortmund, Germany
Recent Presentations at International Conferences
The Edge Interdiction Clique Problem
Presentation, EURO Athens, Greece
Two Branch-and-cut Algorithms for the Directed Network Design Problem with Relays
Presentation, 15th INFORMS Telecommunications and Network Analytics Conference, Online
A New Bilevel Approach For the k-vertex Cut Problem
Presentation, INFORMS Annual Meeting, Seattle, Washington, US
On Integer and Bilevel Formulations for the k-Vertex Cut Problem
Presentation, International Network Optimization Conference, Avignon, France
Optimal vehicle routing with autonomous devices for last-mile delivery
Presentation, VeRoLog - Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization, Seville, Spain
Clique Interdiction Attacks in Networks
Presentation, INFORMS Annual Meeting, Phoenix, AZ, US
Benders Decomposition for Covering Location Problems
Presentation, EURO 2018, Valencia, Spain
Decomposition Approaches to Covering Location Problems
Presentation, ISMP 2018, Bordeaux, France
The Directed Network Design Problem with Relays
Presentation, Odysseus - Seventh International Workshop on Freight Transportation and Logistics, Cagliari, Italy
MIP Modeling of Incremental Connected Facility Location
Presentation, INFORMS Telecommunications Conference, Hamburg, Germany
Decomposition Methods for Stochastic Steiner Trees
Presentation, European Conference on Stochastic Optimization, ECSO, Rome, Italy
Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities
Presentation, Optimization Conference, Lisbon, Portugal
New Decomposition Approaches for the Two-Stage Stochastic Steiner Tree Problem
Presentation, Workshop celebrating the 60th birthday of Luis Gouveia, Lisbon, Portugal
Clique Interdiction in the Social Network Analysis
Presentation, INOC 2017, Lisbon, Portugal
On Clique Interdiction Problems in Graphs
Presentation, ROADEF 2017, Metz, France
Interdiction Games and Monotonicity
Presentation, PGMO Days 2016, Paris, France
A new exact solver for mixed-integer bilevel linear programs based in intersection cuts
Presentation, GO X, Mount Rigi, Switzerland
Intersection Cuts for Mixed-Integer Bilevel Linear Programs
Presentation, EURO 2016, Poznan, Poland
Generalized Benders Cuts for Congested Facility Location
Presentation, TRISTAN 2016, Aruba
Exact Approaches for Network Design Problems with Relays
Presentation, ISCO 2016, Vietri sul Mare, Italy
Solving Minimum-Cost Shared Arborescence Problems
Presentation, INFORMS Telecommunications Conference, Boca Raton, FL, USA
Solving Congested Facility Location by Branch-and-Cut
Presentation, ROADEF, Compiegne, France
Exact Approaches to the Network Design Problem with Relays
Presentation, OR 2015, Vienna, Austria
ILP Formulations for the Lazy Bureaucrat Problem
Presentation, EURO 2015, Glasgow, UK
A node-based layered graph approach for hop-constrained Steiner trees
Presentation, INOC 2015, Warsaw, Poland
The Recoverable Robust Two-Level Network Design Problem
Presentation, SIAM Conference on Optimization, San Diego, CA
The Recoverable Robust Facility Location Problem
Presentation, ISCO 2014, Lissabon, Portugal
The Maximum Weight Connected Subgraph Problem
Presentation, EURO-INFORMS Joint International Meeting, Rome, Italy
Layered graph models for hop constrained trees with multiple roots
Presentation, 21st International Symposium on Mathematical Programming (ISMP), Berlin, Germany
Capacitated Network Design with Facility Location
Presentation, 25th European Conference on Operational Research (EURO 2012), Vilnius, Lithuania
Capacitated Network Design and Facility Location
Presentation, 2nd International Symposium on Combinatorial Optimization (ISCO 2012), Athens, Greece
Solving Two-Stage Network Design Problems by Two-Stage Branch-and-Cut
Presentation, The 11th INFORMS Telecommunications Conference, Boca Raton, FL
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes
Presentation, The 11th INFORMS Telecommunications Conference, Boca Raton, FL
The Two Level Network Design Problem with Secondary Hop Constraints
Presentation, Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany
A Two Level Network Design Problem with Transition Nodes
Presentation, 15th Combinatorial Optimization Workshop, Aussois, France
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Presentation, Computational Management Science 2010, Vienna, Austria
The Generalized Regenerator Location Problem
Presentation, EURO XXIV, Lisbon, Portugal
The Generalized Regenerator Location Problem
Presentation, Journées de l'Optimisation, Montréal, Canada
MIP Models for Connected Facility Location-A Theoretical and Computational Study
Presentation, The 10th INFORMS Telecommunications Conference, Montreal, Canada
A Branch-and-cut-and-price Algorithm for Vertex-biconnectivity Augmentation
Presentation, International Symposium of Mathematical Programming (ISMP), Chicago, Illinois, USA
The Generalized Regenerator Location Problem
Presentation, International Network Optimization Conference (INOC), Pisa, Italy
Exact Approaches to the Single-source Network Loading Problem
Presentation, 13th Combinatorial Optimization Workshop, Aussois, France
Benders Cuts for the Single-source Network Loading Problem
Presentation, INFORMS Annual Meeting 2008, Washington, DC
Strong Formulations for 2-Node-Connected Steiner Network Problems
Presentation, SIAM Conference on Optimization, Boston, Massachusetts
Solving Connected Facility Location to Provable Optimality
Presentation, Ninth INFORMS Telecommunications Conference, University of Maryland, College Park, Washington DC Area
A Hybrid VNS for Connected Facility Location
Presentation, HM 2007, Dormund, Germany
Facility Location and Steiner Trees
Presentation, Optimization, Porto, Portugal
Connected Facility Location-VNS, Tabu-Search and Branch-and-Cut
Presentation, Learning and Intelligent OptimizatioN (LION 2007), Andalo (Trento), Italy
Solving the Prize-Collecting Steiner Tree Problem to Optimality
Presentation, Algorithm Engineering and Experiments (ALENEX 2005), Vancouver, British Columbia, Canada
Other Visited Events
- 17th Combinatorial Optimisation Workshop, Aussois, France, January 7-11, 2013.
- 12th Combinatorial Optimisation Workshop, Aussois, France, January 7-11, 2008.
- 11th Combinatorial Optimisation Workshop, Aussois, France, January 7-12, 2007.
- 7th Combinatorial Optimisation Workshop, Aussois, France, March 9-15, 2003.
- International Summer School on Metaheuristics
- Tenerife (Canary Islands), Spain, March 3-7, 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 two-stage stochastic Steiner tree problems by two-stage branch-and-cut, Department of Computer Science, TU Dortmund (Petra Mutzel), Dortmund, Germany, April 2010
- Two-Level 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
- k-Cardinality Tree Problems , Department of Computer Science, TU Dortmund (Petra Mutzel), Dortmund, Germany, July 2006
- An evolutionary approach to the fractional prize-collecting Steiner tree problem, University of La Laguna (Belen Melian), La Laguna, Spain, July & August 2004