Ivana Ljubic

Invited Talks

  1. From Game Theory to Graph Theory: A Bilevel Journey (EURO 2019 Tutorial),
    EURO 2019: 30th European Conference on Operational Research, 23rd-26th June, 2019, UCD, Dublin, Ireland.

  2. Solving Very Large Scale Covering Location Problems using Branch-and-Benders-Cut (Invited Speaker),
    IX International Workshop on Locational Analysis and Related Problems 2019, Jan 30 - Feb 1, 2019, Cádiz, Spain.

  3. 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.

  4. From Game Theory to Graph Theory: A Bilevel Journey (EURO Plenary),
    OR 2018: International Conference on Operations Research, Sept 12, 2018, Brussels, Belgium.

  5. Very Large Scale Covering Location Problems in the Design of Advanced Metering Infrastructure,
    GERAD Seminar, NSERC-Hydro-Quebec-Schneider Electric Industrial Research Chair on Optimization for the Smart Grid, August 17, 2018, Montreal, Canada

  6. Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear Programs (Plenary Speaker),
    IWOBIP'18, 2nd International Workshop on Bilevel Programming, Inria Lille-Nord Europe, Lille, France, June 18-22 2018.

  7. New Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear Programs,
    Séminaire Parisien d'Optimisation, Institut Henri Poincaré, June 11, 2018, Paris, France

  8. Exact General-Purpose Solvers for Mixed-Integer Bilevel Linear Programs,
    37ème Journées Franciliennes de Recherche Opérationnelle, March 26, 2018, CNAM, Paris, France

  9. 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, June 16, 2017, University Paris 13, France

  10. Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem (Invited Speaker),
    22nd Belgian Mathematical Programming Workshop, La-Roche-en-Ardennes, Belgium, April 21, 2017

  11. A new general-purpose algorithm for mixed-integer bilevel linear programs,
    15ème séminaire du groupe POC "Combinatorial Bi-level optimization",
    LIP6, Université Pierre et Marie Curie - Paris 6, October 7, 2016

  12. 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

  13. Redesigning Benders Decomposition for Large Scale Facility Location,
    GOM Seminar, Universite Libre de Bruxelles, October 19, 2015

  14. On optimal design of charging stations for electric vehicles,
    PGMO Seminar, École Polytechnique, Paris, September 17, 2015

  15. 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

  16. MIP Approaches to the Lazy Bureaucrat and Greedy Boss Problems,
    Séminaire Pôle 2 Optimisation Combinatoire, University Paris Dauphine, Paris, May 11, 2015

  17. The diameter constrained minimum spanning tree problem: Polyhedral study,
    2. Encontro do Centro de Investigação Operacional, Portugal, Lisbon, March 28, 2015

  18. A New Modeling Concept for Facility Location Under Uncertainty,
    Seminar of the Operations Group, Universidad Adolfo Ibanez, Santiago, Chile, March 10, 2015

  19. 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

  20. The Recoverable Robust Facility Location Problem,
    Graz Discrete Mathematics and Optimization Seminar, TU Graz, Austria, May 13, 2014

  21. The Maximum Weight Connected Subgraph Problem: Applications in Bioinformatics,
    The Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine (CIBM),
    University of Newcastle, Australia, August 29, 2013

  22. The Maximum Weight Connected Subgraph Problem,
    COGA Seminar, TU Berlin, November 22, 2012

  23. Solving 2-Stage Stochastic Network Design Problems by 2-Stage Branch-and-Cut,
    Seminarios CIO, Centro de Investigacao Operacional, Faculdade de Ciencias,
    Universidade de Lisboa, July 4, 2012

  24. 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.

  25. The Recoverable Robust Two-Level 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.

  26. Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut,
    Department of Decision Sciences, I2SDS Seminar, George Washington University, January 27, 2012.

  27. The Generalized Regenerator Location Problem,
    Decision, Operations and Information Technologies Seminar, University of Maryland, October 21, 2011.

  28. Dissaggregated Flow Formulation for the Single-Source Network-Loading Problem,
    Workshop on Optical Access Networks, COGA, TU Berlin, Germany, August 16-19, 2010

  29. OptTelNets: Algorithmische Ansätze,
    Workshop on Optical Access Networks, COGA, TU Berlin, Germany, August 16-19, 2010

  30. Two-Stage Branch & Cut for Two-Stage Stochastic Network Design Problems,
    Algorithm Engineering Seminar, Schloss Dagstuhl, Germany, June 27 - July 2, 2010

  31. Connected facility location in the design of telecommunication networks,
    ISDS-Kolloquium , University of Vienna, Austria, March 19, 2007.

  32. Optimization in Telecommunication Networks: Multicommodity Flow, Facility Location and Steiner Tree Problems,
    CI-Colloquium, Sonderforschungbereich Computational Intelligence , University of Dortmund, Germany, July 31, 2006.

Recent Presentations at International Conferences

  1. On Integer and Bilevel Formulations for the k-Vertex Cut Problem,
    INOC 2019 (International Network Optimization Conference), 12-14 June 2019, Avignon, France

  2. Optimal vehicle routing with autonomous devices for last-mile delivery,
    VeRoLog 2019 (Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization), 2-5 June, 2019, Seville, Spain

  3. Clique Interdiction Attacks in Networks,
    INFORMS Annual Meeting, Nov 4-7, 2018, Phoenix, AZ, US

  4. Benders Decomposition for Covering Location Problems,
    EURO 2018, July 9, 2018, Valencia, Spain

  5. Decomposition Approaches to Covering Location Problems,
    ISMP 2018, July 3, 2018, Bordeaux, France

  6. The Directed Network Design Problem with Relays,
    Odysseus 2018, Seventh International Workshop on Freight Transportation and Logistics, June 8, Cagliari, Italy

  7. MIP Modeling of Incremental Connected Facility Location,
    INFORMS Telecommunications Conference 2018, Hamburg, Germany

  8. Decomposition Methods for Stochastic Steiner Trees,
    European Conference on Stochastic Optimization, ECSO 2017, September 22, Rome, Italy

  9. Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities,
    Optimization 2017 Conference, September 7, 2017, Lisbon, Portugal

  10. New Decomposition Approaches for the Two-Stage Stochastic Steiner Tree Problem,
    Workshop celebrating the 60th birthday of Luis Gouveia, September 6, 2017, Lisbon, Portugal

  11. Clique Interdiction in the Social Network Analysis,
    INOC 2017, February 28, 2017, Lisbon, Portugal

  12. On Clique Interdiction Problems in Graphs,
    ROADEF 2017, February 23, 2017, Metz, France

  13. Interdiction Games and Monotonicity,
    PGMO Days 2016, November 8-9, 2016, Paris, France

  14. A new exact solver for mixed-integer bilevel linear programs based in intersection cuts,
    GO X, July 11, 2016 Mount Rigi, Switzerland

  15. Intersection Cuts for Mixed-Integer Bilevel Linear Programs,
    EURO 2016, July 5, 2016, Poznan, Poland

  16. Generalized Benders Cuts for Congested Facility Location,
    TRISTAN 2016, 13-17 June, 2016, Aruba

  17. Exact Approaches for Network Design Problems with Relays,
    ISCO 2016, May 16, 2016, Vietri sul Mare, Italy

  18. Solving Minimum-Cost Shared Arborescence Problems,
    INFORMS Telecommunications Conference 2016, March 21, 2016, Boca Raton, FL, USA

  19. Solving Congested Facility Location by Branch-and-Cut,
    ROADEF 2016, February 10, 2016, Compiegne, France

  20. Exact Approaches to the Network Design Problem with Relays,
    OR 2015, September 2, 2015, Vienna, Austria

  21. ILP Formulations for the Lazy Bureaucrat Problem,
    EURO 2015, July 14, 2015, Glasgow, UK

  22. A node-based layered graph approach for hop-constrained Steiner trees,
    INOC 2015, May 20, 2015, Warsaw, Poland

  23. The Recoverable Robust Two-Level Network Design Problem,
    SIAM Conference on Optimization, May 21, 2014, San Diego, CA

  24. The Recoverable Robust Facility Location Problem,
    ISCO 2014 , March 5, 2014, Lissabon, Portugal

  25. The Maximum Weight Connected Subgraph Problem,
    EURO-INFORMS Joint International Meeting 2013, July 3, 2013, Rome, Italy

  26. Layered graph models for hop constrained trees with multiple roots,
    21st International Symposium on Mathematical Programming (ISMP 2012), August 19-24, 2012, Berlin, Germany

  27. Capacitated Network Design with Facility Location,
    25th European Conference on Operational Research (EURO 2012), July 8-11, 2012, Vilnius, Lithuania

  28. Capacitated Network Design and Facility Location,
    2nd International Symposium on Combinatorial Optimization (ISCO 2012), Athens, Greece, April 17-21, 2012

  29. On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes,
    The 11th INFORMS Telecommunications Conference, Boca Raton, FL, March 15-17,2012

  30. Solving Two-Stage Network Design Problems by Two-Stage Branch-and-Cut,
    The 11th INFORMS Telecommunications Conference, Boca Raton, FL, March 15-17,2012

  31. The Two Level Network Design Problem with Secondary Hop Constraints,
    Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011.

  32. A Two Level Network Design Problem with Transition Nodes,
    15th Combinatorial Optimization Workshop, Aussois, France, January 10-14, 2011.

  33. Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut,
    Computational Management Science 2010, Vienna, Austria, July 28-30, 2010

  34. The Generalized Regenerator Location Problem,
    EURO XXIV Lisbon, Lisbon, Portugal, July 11-14, 2010

  35. MIP Models for Connected Facility Location: A Theoretical and Computational Study,
    The 10th INFORMS Telecommunications Conference, Montreal, Canada, May 5-7, 2010

  36. The Generalized Regenerator Location Problem,
    Journées de l'Optimisation, Montréal, Canada, May 10-12 2010

  37. A Branch-and-cut-and-price Algorithm for Vertex-biconnectivity Augmentation,
    International Symposium of Mathematical Programming (ISMP), Chicago, Illinois, USA, August 23 - 28, 2009

  38. The Generalized Regenerator Location Problem,
    International Network Optimization Conference (INOC), Pisa, Italy, April 26-29, 2009

  39. Exact Approaches to the Single-source Network Loading Problem,
    13th Combinatorial Optimization Workshop, Aussois, France, January 11-17, 2009.

  40. Benders Cuts for the Single-source Network Loading Problem,
    INFORMS Annual Meeting 2008, Washington, DC, October 12-15, 2008.

  41. Strong Formulations for 2-Node-Connected Steiner Network Problems,
    SIAM Conference on Optimization, Boston, Massachusetts, May 10-13, 2008.

  42. Solving Connected Facility Location to Provable Optimality,
    Ninth INFORMS Telecommunications Conference, University of Maryland, College Park, Washington, DC Area, March 27-29, 2008.

  43. A Hybrid VNS for Connected Facility Location,
    HM 2007, Dormund, Germany, October 8-9 , 2007.

  44. Facility Location and Steiner Trees,
    Optimization 2007, Porto, Portugal, July 22-25, 2007.

  45. Connected Facility Location: VNS, Tabu-Search and Branch-and-Cut,
    Learning and Intelligent OptimizatioN (LION 2007), Andalo (Trento), Italy, February 12-18, 2007.

  46. Solving the Prize-Collecting Steiner Tree Problem to Optimality,
    Algorithm Engineering and Experiments (ALENEX 2005) , Vancouver, British Columbia, Canada, January 22, 2005.

Other Visited Events

  1. 17th Combinatorial Optimisation Workshop, Aussois, France, January 7-11, 2013.
  2. 12th Combinatorial Optimisation Workshop, Aussois, France, January 7-11, 2008.
  3. 11th Combinatorial Optimisation Workshop, Aussois, France, January 7-12, 2007.
  4. 7th Combinatorial Optimisation Workshop, Aussois, France, March 9-15, 2003.
  5. International Summer School on Metaheuristics,
    Tenerife (Canary Islands), Spain, March 3-7, 2003.

Research Visits Abroad

  1. Visiting Professor at the University Adolfo Ibanez, Santiago, Chile (March 2015)
  2. Visiting Professor at the University of Paris, Dauphine (September 2014)
  3. Visiting Researcher at the TU Berlin (October 2012 - Mai 2013)
  4. Visiting Researcher at the TU Dortmund (April 2012 - September 2012)
  5. Visiting Assistant Professor at the University of Maryland (July 2011 - March 2012)
  6. Other Research Visits:
    1. Optical Access Networks, COGA, TU Berlin (Andreas Bley), Germany, August, 2010
    2. The Generalized Regenerator Location Problem, Robert H. Smith School of Business, University of Maryland (S. Raghavan) College Park, MD, May 2010
    3. 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
    4. Two-Level Network Design Problems, Department of Statistics and Operations Research, Faculty of Sciences, Centro de Investigação Operacional (Luis Gouveia), Portugal, February 2010
    5. Polyhedral Study of the Connected Facility Location Polytope, Department of Computer Science, TU Dortmund (Petra Mutzel), Dortmund, Germany, May 2009
    6. The Generalized Regenerator Location Problem, Robert H. Smith School of Business, University of Maryland (S. Raghavan) College Park, MD, October 2008
    7. The Regenerator Location Problem, Robert H. Smith School of Business, University of Maryland (S. Raghavan) College Park, MD, April 2008
    8. Exact Approaches to Network Design Problems, Department of Computer Science, TU Dortmund (Petra Mutzel), Dortmund, Germany, July 2007
    9. k-Cardinality Tree Problems , Department of Computer Science, TU Dortmund (Petra Mutzel), Dortmund, Germany, July 2006
    10. An evolutionary approach to the fractional prize-collecting Steiner tree problem, University of La Laguna (Belen Melian), La Laguna, Spain, July & August 2004