Scientific Talks

    1. Using Variables Aggregation and Benders Decomposition for Solving Large-Scale Extended Formulations, INOC 2017, Lisbon, Portugal, 2017
    2. On Optimal Design of Charging Stations for Electric Vehicles. Centro de Matematica, Aplicacoes Fundamentais e Investigacao Operacional, University of Lisbon, Portugal, 2015
    3. Integer Programming Formulations for Survivable Hop Constrained Network Design, OR 2015, Vienna, Austria, 2015
    4. Design of Survivable Networks with Length Constraints, EURO 2015, Glasgow, United Kingdom, 2015
    5. Integer Programming Formulations for Survivable Hop Constrained Network Design, CORS/INFORMS 2015, Montreal, Canada, 2015
    6. Branch-Price-and-Cut for Undirected Multicommodity Fixed-Charge Network Design, INOC 2015, Warsaw, Poland, 2015
    7. Design of Survivable Networks with Length Constraints, INOC 2015, Warsaw, Poland, 2015
    8. Models and Exact Approaches for the Two-Level Diameter Constrained Spanning Tree Problem, CIRRELT & COMEX Workshop on Network Design, Montreal, Canada, 2014
    9. A Polyhedral Study of the Diameter Constrained Spanning Tree Problem, OR 2014, Aachen, Germany, 2014
    10. A Polyhedral Study of the Diameter Constrained Spanning Tree Problem, IFORS 2014, Barcelona, Spain, 2014
    11. A Polyhedral Study of the Diameter Constrained Spanning Tree Problem, ISCO 2014, Lisbon, Portugal, 2014
    12. The k-Architecture Connected Facility Location Problem. EURO-INFORMS 2013, Rome, Italy, 2013
    13. The Two-Level Diameter Constrained Spanning Tree Problem. INOC 2013, Costa Adeje, Tenerife, Spain, 2013
    14. The Two-Level Diameter Constrained Spanning Tree Problem. 17th Combinatorial Optimization Workshop, Aussois, France, 2013
    15. Variable Neighborhood Search for Solving the Balanced Location Problem. EURO Mini Conference XXVIII on Variable Neighbourhood Search, Herceg Novi, Montenegro, 2012
    16. Models for the Two-Level Diameter Constrained Spanning Tree Problem. ISMP 2012, Berlin, Germany, 2012
    17. Layered Graph Approaches for the Hop Constrained Steiner Tree Problem with multiple Root Nodes. EURO 2012, Vilnius, Lithuania, 2012
    18. On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. ISCO 2012, Athens, Greece, 2012
    19. Stabilized Branch-and-Price for Constrained Tree Problems. Centro de Investigacao Operacional, University of Lisbon, Portugal, 2011
    20. Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem. INOC 2011, Hamburg, Germany, 2011
    21. Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem. ALIO/EURO Workshop on Applied Combinatorial Optimization, Porto, Portugal, 2011
    22. Stabilized branch-and-price for topological network design problems. Optimierungsseminar, Zuse Institute Berlin, Germany, 2011
    23. Variable neighborhood search for capacitated connected facility location. EUROCAST 2011, Las Palmas de Gran Canaria, Spain, 2011
    24. Strong lower bounds for a survivable network design problem. ISCO 2010, Hammamet, Tunesia, 2010
    25. A Lagrangian decomposition based heuristic for capacitated connected facility location. MIC 2009, Hamburg, Germany, 2009
    26. Accelerating column generation for a survivable network design problem. INOC 2009, Pisa, Italy, 2009
    27. Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks. HM 2008, Malaga, Spain, 2008
    28. Variable neighborhood search for a prize collecting capacity constrained connected facility location problem. SAINT 2008, Turku, Finland, 2008
    29. A Lagrangian Relaxation approach for the design of the last mile in real-world fiber optic networks. Joint Workshop: Austrian Workshop on Metaheuristics 5 & Experimental Economics, Graz, Austria, November 27, 2007