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