LJUBIC Ivana

See the full publication list including preprints. See the Google Scholar Profile and a list of scientific talks.

NEWS:

• The Glover-Klingman Prize for the best Networks paper in 2021 for the article Ivana Ljubić: Solving Steiner trees: Recent advances, challenges, and perspectives, Networks 77 (2): 177-204, 2021
• Marguerite Frank Award for the best EJCO paper in 2021 for the paper A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. Jointly with Thomas Kleinert, Martine Labbé, and Martin Schmidt.
• Keynote speaker: CPAIOR 2023 
• Plenary speaker: PGMO Days 2022, Nov 2022
• Plenary speaker: SIAM Conference on Optimization (OP21), July 2021 

BIO:

Ivana Ljubic is Full Professor in Operations Research at ESSEC. She teaches Decision Analysis, Optimal Decision Making, Operations Research (OR) and Business Mathematics in ESSEC MSc, PhD and Advanced Master programs. Prior to joining ESSEC in 2015, she was appointed at the University of Vienna. She also worked as Visiting Scholar/Professor at the Robert H. Smith School of Business at the University of Maryland, TU Dortmund, TU Berlin, Dauphine University, etc. From 2017 to 2019 she was Academic Director of the ESSEC EMBA program, and from 2017 to 2021 she was Academic Director of the ESSEC & Mannheim EMBA program. She has published numerous scientific articles in leading outlets and has been ranked since 2018 amongst the Top 5% of most successful business professors in Germany, Switzerland, and Austria according to various publication rankings. 

Ivana Ljubic has carried out consulting studies and industrial contracts for leading telecommunication providers in France and Austria. After completing her PhD in computer science, she also worked for 2 years as Financial Analyst for a Siemens spin-off (fin4cast), focusing on portfolio optimization.

Research interests of Ivana Ljubic include combinatorial optimization, optimization under uncertainty, bilevel optimization. She uses tools and methods of mixed integer (non-) linear programming, meta-heuristics and their successful combinations for solving optimization problems with applications in network design, telecommunications, transportation, logistics, routing and bioinformatics. She has published more than 70 articles in leading OR journals, including Operations Research, Management Science, Mathematical Programming, INFORMS JOC, European Journal of Operational Research.

She is member of the Editorial Advisory Board for the journals European Journal of Operational Research, Computers & Operations Research, and she is Associate Editor for the journals Operations Research (since 2023), Transportation Science (since 2021), Networks (since 2020), Journal of Global Optimization (2019-2021) and Omega (2016-2020). She also served as guest-editor of journals: Discrete Applied Mathematics, European Journal of Operational Research and Annals of Operations Research.

She is past chair of the INFORMS Telecommunication and Network Analytics Section. From 2010-2016 she was member of council of the INFORMS Telecommunication Section and from 2006 to 2008 she was member of the executive board of the Austrian OR Society (OEGOR).

She has received numerous research grants, including those from the French Ministry of Foreign Affairs (PHC program), Austrian Academy of Sciences (OEAW), Austrian Research Fund (FWF) and European Commission (ERA-NET).

SOME VIDEO LECTURES:

• Beale Lecture 2021 - panel discussion honoring Dr. Ailsa Land, the winner of Beale Medal 2019 (video)
• Plenary talk: New integer and Bilevel Formulations for the k-Vertex Cut Problem,
  5th AIRO Young Workshop, Napoli, Italy and online, February 12, 2021 (Video Lecture)
• Plenary talk: Casting Light on the Hidden Bilevel Structure of the Capacitated Vertex Separator Problem, Mixed Integer Programming Workshop 2020 Online Edition (MIP2020), May 18, 2020 (Video)
• Invited Lecture: Branch-and-Cut Solvers for Mixed-Integer Bilevel Linear Programs,
  Autumn School on Bilevel Optimization (online), Oct 12-14, 2020, Uni Trier, Germany (Video Lecture Part 1 and Part 2)

• 2013 : Habilitation en Recherche des Opérations (Université de Vienne, Autriche)
• 2013 : Habilitation en Recherche des Opérations (Université de Vienne, Autriche)
• 2004 : Ph.D. en Informatique (TU Wien, Autriche)
• 2004 : Ph.D. en Informatique (TU Wien, Autriche)
• 2000 : Master of Science degree (MSc), Department for Optimization and Numerical Analysis, Faculty of Mathematics (University of Belgrade, Serbie)
• 2000 : Master of Science degree (MSc), Department for Optimization and Numerical Analysis, Faculty of Mathematics (University of Belgrade, Serbie)

Positions académiques principales

• 2016 - présent : Professeur (ESSEC Business School, France)
• 2016 - présent : Professeur (ESSEC Business School, France)
• 2015 - 2016 : Professeur associé (ESSEC Business School, France)
• 2015 - 2016 : Professeur associé (ESSEC Business School, France)
• 2011 - 2015 : Professeur associé (Université de Vienne, Autriche)
• 2011 - 2015 : Professeur associé (Université de Vienne, Autriche)
• 2007 - 2010 : Post-Doc Researcher & Lecturer, ISOR (Université de Vienne, Autriche)
• 2007 - 2010 : Post-Doc Researcher & Lecturer, ISOR (Université de Vienne, Autriche)
• 2000 - 2004 : Research and Teaching Assistant (PhD candidate) (TU Wien, Autriche)
• 2000 - 2004 : Research and Teaching Assistant (PhD candidate) (TU Wien, Autriche)

Autres positions académiques

• 2017 - 2021 : Directrice Académique du programme EMBA ESSEC & Mannheim (ESSEC Business School, France)
• 2017 - 2021 : Directrice Académique du programme EMBA ESSEC & Mannheim (ESSEC Business School, France)
• 2018 - 2019 : Member of the “Task Force: future directions, strategy, evaluation” (ESSEC Business School, France)
• 2018 - 2019 : Member of the “Task Force: future directions, strategy, evaluation” (ESSEC Business School, France)
• 2016 - 2018 : Membre du Comité Scientifique (ESSEC Business School, France)
• 2016 - 2018 : Membre du Comité Scientifique (ESSEC Business School, France)
• 2013 - 2015 : Member of the doctoral advisory board at ISOR (Université de Vienne, Autriche)
• 2013 - 2015 : Member of the doctoral advisory board at ISOR (Université de Vienne, Autriche)
• 2015 : Professeur visitant (Universidad Adolfo Ibáñez, Chili)
• 2015 : Professeur visitant (Universidad Adolfo Ibáñez, Chili)
• 2014 : Professeur visitant (Université Paris-Dauphine, PSL University, France)
• 2014 : Professeur visitant (Université Paris-Dauphine, PSL University, France)
• 2012 - 2013 : Professeur visitant (Technische Universität Berlin, Allemagne)
• 2012 - 2013 : Professeur visitant (Technische Universität Berlin, Allemagne)
• 2011 - 2012 : Professeur visitant (University of Maryland, États-Unis)
• 2011 - 2012 : Professeur visitant (University of Maryland, États-Unis)
• 2012 : Professeur visitant (TU Dortmund Universität, Allemagne)
• 2012 : Professeur visitant (TU Dortmund Universität, Allemagne)

• 2022 : Marguerite Frank Award for the best EJCO paper in 2021 for the paper A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. Jointly with Thomas Kleinert, Martine Labbé, and Martin Schmidt
• 2022 : Marguerite Frank Award for the best EJCO paper in 2021 for the paper A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. Jointly with Thomas Kleinert, Martine Labbé, and Martin Schmidt
• 2021 : The Glover-Klingman Prize for the best Networks paper in 2021
• 2021 : The Glover-Klingman Prize for the best Networks paper in 2021
• 2016 : Ivana Ljubic a reçu le Best Paper Award au congrès : "INFORMS Telecommunications Conference 2016" pour son article : S. Chen, I. Ljubic, S. Raghavan: The Generalized Regenerator Location Problem, INFORMS Journal on Computing 27(2): 204 - 220, 2015.
• 2016 : Ivana Ljubic a reçu le Best Paper Award au congrès : "INFORMS Telecommunications Conference 2016" pour son article : S. Chen, I. Ljubic, S. Raghavan: The Generalized Regenerator Location Problem, INFORMS Journal on Computing 27(2): 204 - 220, 2015.
• 2014 : Finaliste du Best Paper Award de l'INFORMS Telecommunication Section (avec L. Gouveia, M. Leitner)
• 2014 : Finaliste du Best Paper Award de l'INFORMS Telecommunication Section (avec L. Gouveia, M. Leitner)
• 2014 : Gagnante du challenge d'implémentation DIMACS sur les arbres de Steiner (avec M. Fischetti et al.)
• 2014 : Gagnante du challenge d'implémentation DIMACS sur les arbres de Steiner (avec M. Fischetti et al.)
• 2005 : Prix PhD award de l'Austrian Society for Operations Research (Autriche)
• 2005 : Prix PhD award de l'Austrian Society for Operations Research (Autriche)

• 2017 - 2018 : Co-applicant Prescriptive Analytics – Operations research, Initiative d’Excellence Paris Seine
• 2017 - 2018 : Co-applicant Prescriptive Analytics – Operations research, Initiative d’Excellence Paris Seine
• 2015 - 2018 : Co-PI Optimization and Analysis of Large-Scale Networks (ICT 2015) WWTF
• 2015 - 2018 : Co-PI Optimization and Analysis of Large-Scale Networks (ICT 2015) WWTF
• 2014 - 2017 : Applicant and leader (PI): Network Optimization in Bioinformatics and Systems Biology, FWF
• 2014 - 2017 : Applicant and leader (PI): Network Optimization in Bioinformatics and Systems Biology, FWF
• 2014 - 2017 : Co-applicant: e4-share: Models for Ecological, Economical, Efficient, Electric Car-Sharing, JPI Urban Europe
• 2014 - 2017 : Co-applicant: e4-share: Models for Ecological, Economical, Efficient, Electric Car-Sharing, JPI Urban Europe
• 2012 - 2015 : Applicant and leader (PI) of the Austrian team: Multi-Criteria Optimization of FTTx Networks, (DACH programme, cooperation with the TU Wien and ZIB Berlin), FWF & DFG
• 2012 - 2015 : Applicant and leader (PI) of the Austrian team: Multi-Criteria Optimization of FTTx Networks, (DACH programme, cooperation with the TU Wien and ZIB Berlin), FWF & DFG
• 2011 - 2013 : APART Fellowship à l'Austrian Academy of Sciences (Autriche)
• 2011 - 2013 : APART Fellowship à l'Austrian Academy of Sciences (Autriche)
• 2011 - 2013 : Applicant and leader (PI): Network Design Under Uncertainty: Algorithmic Aspects of Stochastic and Robust Optimization (APART programme), OEAW
• 2011 - 2013 : Applicant and leader (PI): Network Design Under Uncertainty: Algorithmic Aspects of Stochastic and Robust Optimization (APART programme), OEAW
• 2011 - 2014 : Member of the graduate school in Computational Optimization (Initiativkolleg programme), University of Vienna
• 2011 - 2014 : Member of the graduate school in Computational Optimization (Initiativkolleg programme), University of Vienna
• 2010 - 2011 : Applicant and leader (PI) of the Austrian team: Flow Projection Results in Telecommunication: Models and Algorithms (Acciones Integradas programme, in cooperation with the University of La Laguna, Spain), OEAD (Austrian exchange service)
• 2010 - 2011 : Applicant and leader (PI) of the Austrian team: Flow Projection Results in Telecommunication: Models and Algorithms (Acciones Integradas programme, in cooperation with the University of La Laguna, Spain), OEAD (Austrian exchange service)
• 2007 - 2010 : Applicant and leader (PI): Algorithmic Solutions for Last-Mile Networks, (Hertha-Firnberg programme), FWF
• 2007 - 2010 : Applicant and leader (PI): Algorithmic Solutions for Last-Mile Networks, (Hertha-Firnberg programme), FWF
• 2007 - 2010 : Applicant and leader (one of two PIs): Algorithmic Solutions for Optimal Design of Telecommunication Networks, (Bridge programme, cooperation with Telekom Austria AG), FFG
• 2007 - 2010 : Applicant and leader (one of two PIs): Algorithmic Solutions for Optimal Design of Telecommunication Networks, (Bridge programme, cooperation with Telekom Austria AG), FFG
• 2007 - 2010 : Hertha-Firnberg Post-Doc Fellowship de l'Austrian Science Fund (Autriche)
• 2007 - 2010 : Hertha-Firnberg Post-Doc Fellowship de l'Austrian Science Fund (Autriche)
• 2003 - 2004 : Applicant and leader (PI): Combinatorial and Memetic Algorithms for Selected Network Design Problems (DOC programme). OEAW
• 2003 - 2004 : Applicant and leader (PI): Combinatorial and Memetic Algorithms for Selected Network Design Problems (DOC programme). OEAW
• 2003 - 2004 : PhD Fellowship de l'Austrian Academy of Sciences (Autriche)
• 2003 - 2004 : PhD Fellowship de l'Austrian Academy of Sciences (Autriche)
• 2002 - 2004 : Doctoral Scholarship Programme of the OEAW (DOC Programme)
• 2002 - 2004 : Doctoral Scholarship Programme of the OEAW (DOC Programme)

• LEITNER, M., LJUBIC, I., MONACI, M., SINNL, M. and TANINMIS, K. (2023). An Exact Method for Binary Fortification Games. European Journal of Operational Research, 307(3), pp. 1026-1039.
• DELLE DONNE, D., ARCHETTI, C., ALFANDARI, L. and LJUBIC, I. (2023). Freight-on-Transit for urban last-mile deliveries: A strategic planning approach. Transportation Research Part B: Methodological, 169, pp. 53-81.
• BECK, Y., LJUBIC, I. and SCHMIDT, M. (2023). A survey on bilevel optimization under uncertainty. European Journal of Operational Research, 311(2), pp. 401-426.
• MOUACI, A., GOURDIN, , LJUBIC, I. and PERROT, N. (2023). Two extended formulations for the virtual network function placement and routing problem. Networks, 82(1), pp. 32-51.
• CERULLI, M., SERRA, D., SORGENTE, C., ARCHETTI, C. and LJUBIC, I. (2023). Mathematical programming formulations for the collapsed k-core problem. European Journal of Operational Research, In press.
• RAMIREZ-PICO, C., LJUBIC, I. and MORENO, E. (2023). Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs. Transportation Science, In press.
• GAAR, E., LEE, J., LJUBIC, I., SINNL, M. and TANINMIS, K. (2023). On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. Mathematical Programming, In press.
• BECK, Y., LJUBIC, I. and SCHMIDT, M. (2023). Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsack problem. Mathematical Programming Computation, In press.
• FURINI, F., LJUBIC, I., MALAGUTI, E. and PARONUZZI, P. (2022). Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem. Operations Research, 70(4), pp. 2399–2420.
• ALFANDARI, L., LJUBIC, I. and DE MELO DA SILVA, M. (2022). A tailored Benders decomposition approach for last-mile delivery with autonomous robots. European Journal of Operational Research, 299(2), pp. 510-525.
• KESHVARI FARD, M., LJUBIC, I. and PAPIER, F. (2022). Budgeting in International Humanitarian Organizations. Manufacturing & Service Operations Management, 24(3), pp. 1562-1577.
• FERNÁNDEZ, E., LEITNER, M., LJUBIC, I. and RUTHMAIR, M. (2022). Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption. Transportation Science, 56(5), pp. 1111-1408.
• CONIGLIO, S., FURINI, F. and LJUBIC, I. (2022). Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. Mathematical Programming, 196(1-2), pp. 9-56.
• ÁLVAREZ-MIRANDA, E., GOYCOOLEA, M., LJUBIC, I. and SINNL, M. (2021). The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. European Journal of Operational Research, 289(3), pp. 1013-1029.
• LJUBIC, I. (2021). Solving Steiner trees: Recent advances, challenges, and perspectives. Networks, 77(2), pp. 177-204.
• ALFANDARI, L., HASSANZADEH, A. and LJUBIC, I. (2021). An Exact Method for Assortment Optimization under the Nested Logit Model. European Journal of Operational Research, 291(3), pp. 830-845.
• FURINI, F., LJUBIC, I., SAN SEGUNDO, P. and ZHAO, Y. (2021). A branch-and-cut algorithm for the Edge Interdiction Clique Problem. European Journal of Operational Research, 294(1), pp. 54-69.
• LJUBIC, I., MOUACI, A., PERROT, N. and GOURDIN, E. (2021). Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem. Computers & Operations Research, 130(105227).
• KLEINERT, T., LABBÉ, M., LJUBIC, I. and SCHMIDT, M. (2021). A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. European Journal on Computational Optimization, 9, pp. 100007.
• LEITNER, M., LJUBIC, I., RIEDLER, M. and RUTHMAIR, M. (2020). Exact Approaches for Network Design Problem with Relays. Omega, 91.
• LJUBIC, I., FURINI, F., MALAGUTI, E. and PARONUZZI, P. (2020). On Integer and Bilevel Formulations for the k-Vertex Cut Problem. Mathematical Programming Computation, 12, pp. 133-164.
• BRANDSTÄTTER, G., LEITNER, M. and LJUBIC, I. (2020). Location of Charging Stations in Electric Car Sharing Systems. Transportation Science, 54(5), pp. 1408-1438.
• GOUVEIA, L., LEITNER, M. and LJUBIC, I. (2020). A polyhedral study of the diameter constrained minimum spanning tree problem. Discrete Applied Mathematics, 285, pp. 364-379.
• CORDEAU, J.F., FURINI, F. and LJUBIC, I. (2019). Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Location Problems. European Journal of Operational Research, 275(3), pp. 882-896.
• ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. and MARTIN, S. (2019). Tighter MIP models for Barge Container Ship Routing. Omega, 82, pp. 38-54.
• FURINI, F., LJUBIC, I., MARTIN, S. and SAN SEGUNDO, P. (2019). The Maximum Clique Interdiction Problem. European Journal of Operational Research, 277(1), pp. 112-127.
• FISCHETTI, M., LJUBIC, I., MONACI, M. and SINNI, M. (2019). Interdiction Games and Monotonicity, with Application to Knapsack Problems. INFORMS Journal on Computing, 31(2), pp. 390-410.
• ARULSELVAN, A., BLEY, A. and LJUBIC, I. (2019). The Incremental Connected Facility Location Problem. Computers & Operations Research, 112.
• SAN SEGUNDO, P., CONIGLIO, S., FURINI, F. and LJUBIC, I. (2019). A new branch-and-bound algorithm for the maximum edge-weighted clique problem. European Journal of Operational Research, 278(1), pp. 76-90.
• LEITNER, M., LJUBIC, I., LUIPERSBECK, M. and SINNL, M. (2018). A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. INFORMS Journal on Computing, 30(2), pp. 402-420.
• LEITNER, M., LJUBIC, I., LUIPERSBECK, M. and SINNL, M. (2018). Decomposition Methods for the Two-Stage Stochastic Steiner Tree Problem. Computational Optimization and Applications, 69(3), pp. 713-752.
• FISCHETTI, M., LJUBIC, I., MONACI, M. and SINNL, M. (2018). On the Use of Intersection Cuts for Bilevel Optimization. Mathematical Programming, 172(1-2), pp. 77-103.
• LJUBIC, I. and MORENO, E. (2018). Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities. European Journal of Operational Research, 266(1), pp. 46-56.
• LEITNER, M., LJUBIC, I., SALAZAR-GONZALEZ, J.J. and SINNL, M. (2018). The Connected Facility Location Polytope. Discrete Applied Mathematics, 234, pp. 151-167.
• FISCHETTI, M., LJUBIC, I., MONACI, M. and SINNL, M. (2017). A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. Operations Research, 65(6), pp. 1615-1637.
• BLEY, A., LJUBIC, I. and MAURER, O. (2017). A Node-Based ILP Formulation for the Node-Weighted Dominating Steiner Problem. Networks, 69(1), pp. 33-51.
• LEITNER, M., LJUBIC, I., SALAZAR-GONZALEZ, J.J. and SINNL, M. (2017). An Algorithmic Framework for the Exact Solution of Tree-Star Problems. European Journal of Operational Research, 1(261), pp. 54-66.
• FURINI, F., LJUBIC, I. and SINNL, M. (2017). An Effective Dynamic Programming Algorithm for the Minimum-Cost Maximal Knapsack Packing Problem. European Journal of Operational Research, 262(2), pp. 438-448.
• FISCHETTI, M., LJUBIC, I. and SINNL, M. (2017). Redesigning Benders Decomposition for Large-Scale Facility Location. Management Science, 63(7), pp. 2146-2162.
• ÁLVAREZ-MIRANDA, E., LJUBIC, I., LUIPERSBECK, M. and SINNL, M. (2017). Solving Minimum-Cost Shared Arborescence Problems. European Journal of Operational Research, 258(3), pp. 887-901.
• LJUBIC, I., MUTZEL, P. and ZEY, B. (2017). Stochastic Survivable Network Design Problems: Theory and Practice. European Journal of Operational Research, 256(2), pp. 333-348.
• FISCHETTI, M., LEITNER, M., LJUBIC, I., LUIPERSBECK, M., MONACI, M. and RESCH, M. (2017). Thinning out Steiner Trees: A Node-Based Model for Uniform Edge Costs. Mathematical Programming Computation, 9(2), pp. 203-229.
• EHRGOTT, M., LJUBIC, I. and PARRAGH, S.N. (2017). Feature cluster: Recent advances in exact methods for multi-objective optimisation. European Journal of Operational Research, 260(3), pp. 805-806.
• SINNL, M. and LJUBIC, I. (2016). A Node-Based Layered Graph Approach for the Steiner Tree Problem with Revenues, Budget and Hop-Constraints. Mathematical Programming Computation, 8(4), pp. 461–490.
• FICHETTI, M., LJUBIC, I. and SINNL, M. (2016). Benders Decomposition without Separability: A Computational Study for Capacitated Facility Location Problems. European Journal of Operational Research, 253(3), pp. 557-569.
• LEITNER, M., LJUBIC, I., SINNL, M. and WERNER, A. (2016). ILP Heuristics and a New Exact Method for Bi-Objective 0/1 ILPs: Application to FTTx-Network Design. Computers & Operations Research, 72, pp. 128-146.
• ÁLVAREZ-MIRANDA, E., FERNÁNDEZ, E. and LJUBIC, I. (2015). The Recoverable Robust Facility Location Problem. Transportation Research Part B: Methodological, 79(1), pp. 93-120.
• CHEN, S., LJUBIC, I. and RAGHAVAN, S. (2015). The Generalized Regenerator Location Problem. INFORMS Journal on Computing, 27(2), pp. 204-220.
• GOUVEIA, L., LEITNER, M. and LJUBIC, I. (2015). The Two-Level Diameter Constrained Spanning Tree Problem. Mathematical Programming, 150(1), pp. 49-78.
• LJUBIC, I., PUTZ, P. and SALAZAR-GONZALEZ, J.J. (2014). A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem. European Journal of Operational Research, 235(3), pp. 727-739.
• GOUVEIA, L., LEITNER, M. and LJUBIC, I. (2014). Hop constrained Steiner trees with multiple root nodes. European Journal of Operational Research, 236(1), pp. 100-112.
• LEITNER, M., LJUBIC, I. and SINNL, M. (2014). The bi-objective prize-collecting Steiner tree problem. INFORMS Journal on Computing, 27(1), pp. 118-134.
• ÁLVAREZ-MIRANDA, E., LJUBIC, I. and RAGHAVAN, S. (2014). The Recoverable Robust Two-Level Network Design Problem. INFORMS Journal on Computing, 27(1), pp. 1-19.
• GOLLOWITZER, S., GENDRON, B. and LJUBIC, I. (2013). A cutting plane algorithm for the Capacitated Connected Facility Location Problem. Computational Optimization and Applications, 55(3), pp. 647-674.
• ALVAREZ-MIRANDA, E., LJUBIC, I. and TOTH, P. (2013). A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR: A Quarterly Journal of Operations Research, 11(4), pp. 349-360.
• GOLLOWITZER, S., GOUVEIA, L. and LJUBIC, I. (2013). Enhanced Formulations and Branch-and-Cut for the Two Level Network Design Problem with Transition Facilities. European Journal of Operational Research, 225(2), pp. 211-222.
• ALVAREZ-MIRANDA, E., LJUBIC, I. and TOTH, P. (2013). Exact Approaches for Solving Robust Prize-Collecting Steiner Tree Problems, European Journal of Operational Research. European Journal of Operational Research, 229(3), pp. 599-612.
• BLEY, A., LJUBIC, I. and MAURER, O. (2013). Lagrangian decompositions for the two-level FTTx network design problem. Computational Optimization and Applications, 1(3), pp. 221-252.
• LJUBIC, I., PUTZ, P. and SALAZAR-GONZALEZ, J.J. (2012). Exact approaches to the single-source network loading problem. Networks, 59(1), pp. 89-106.
• LJUBIC, I. and GOLLOWITZER, S. (2012). Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem. INFORMS Journal on Computing, 25(2), pp. 256-270.
• FROMMLET, F., LJUBIC, I., BJÖRK ARNARDÓTTIR, H. and BOGDAN, M. (2012). QTL Mapping Using a Memetic Algorithm with Modifications of BIC as Fitness Function. Statistical Applications in Genetics and Molecular Biology, 11(4).
• GOLLOWITZER, S. and LJUBIC, I. (2011). MIP models for connected facility location: A theoretical and computational study. Computers & Operations Research, 38(2), pp. 435-449.
• LJUBIC, I. (2010). A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. Networks, 56(3), pp. 169-182.
• CHIMANI, M., KANDYBA, M., LJUBIC, I. and MUTZEL, P. (2010). Orientation-based models for {0,1,2}-survivable network design: theory and practice. Mathematical Programming, 124(1), pp. 413-440.
• LJUBIC, I. and CHEN, S. (2010). The regenerator location problem. Networks, 55(3), pp. 205-220.
• LJUBIC, I., CHIMANI, M., KANDYBA, M. and MUTZEL, P. (2009). Obtaining optimal k-cardinality trees fast. ACM Journal of Experimental Algorithmics (JEA), 14(5), pp. 5.1-5.23.
• LJUBIC, I., WEISKIRCHER, R., PFERSCHY, U., KLAU, G., MUTZEL, P. and FISCHETTI, M. (2006). An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Mathematical Programming, 105(2), pp. 427-449.
• LJUBIC, I. and RAIDL, G.R. (2003). A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. Journal of Heuristics, 9(5), pp. 401-428.
• RAIDL, G.R. and LJUBIC, I. (2002). Evolutionary Local Search for the Edge-Biconnectibity Augmentation Problem. Information Processing Letters, 82(1), pp. 39-45.
• LJUBIC, I., TOŠIC, D., FILIPOVIC, V. and KRATICA, J. (2001). Solving the simple plant location problem by genetic algorithms. RAIRO - Operations Research, 35(1), pp. 127-142.

• LJUBIC, I., BARAHONA, F., DEY, S.S. and MAHJOUB, A.R. [Eds] (2022). Combinatorial Optimization. New York: Springer.
• LJUBIC, I., DOERNER, K., TRAGLER, G. and PFLUG, G. [Eds] (2016). Operations Research Proceedings 2015. Springer.

• GAAR, E., LEE, J., LJUBIC, I., SINNL, M. and TANINMIŞ, K. (2022). SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. In: Karen Aardal, Laura Sanità eds. Integer Programming and Combinatorial Optimization. 1st ed. Cham: Springer, pp. 262-276.
• FISCHETTI, M., LJUBIC, I., MONACI, M. and SINNL, M. (2016). Intersection Cuts for Bilevel Optimization. In: Integer Programming and Combinatorial Optimization. 1st ed. Berlin: Springer Computer Science, pp. 77-88.
• LJUBIC, I., ALVAREZ-MIRANDA, E. and MUTZEL, P. (2013). The Maximum Weight Connected Subgraph Problem. In: Facets of Combinatorial Optimization. 1st ed. Springer, pp. 245-270.
• LJUBIC, I. (2007). A Hybrid VNS for Connected Facility Location. In: Thomas Bartz-Beielstein, María José Blesa Aguilera, Christian Blum, Boris Naujoks, Andrea Roli, Günter Rudolph, Michael Sampels eds. Hybrid Metaheuristics. 1 ed. Springer Berlin Heidelberg, pp. 157-169.
• KLAU, G.W., LJUBIC, I., MOSER, A., MUTZEL, P., NEUNER, P., PFERSCHY, U. and WEISKIRCHER, R. (2004). Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. In: Kalyanmoy Deb (ed.). Genetic and Evolutionary Computation – GECCO 2004. 1 ed. Springer Berlin Heidelberg, pp. 1304-1315.
• KRATICA, J., LJUBIC, I. and TOŠIĆ, D. (2003). A Genetic Algorithm for the Index Selection Problem. In: Stefano Cagnoni, Colin G. Johnson, Juan J. Romero Cardalda, Elena Marchiori, David W. Corne, Jean-Arcady Meyer, Jens Gottlieb, Martin Middendorf, Agnès Guillot, Günther R. Raidl, Emma Hart eds. Applications of Evolutionary Computing. 1 ed. Springer Berlin Heidelberg, pp. 280-290.
• KERSTING, S., RAIDL, G.R. and LJUBIC, I. (2002). A Memetic Algorithm for Vertex-Biconnectivity Augmentation. In: Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl eds. Applications of Evolutionary Computing. 1 ed. Springer Berlin Heidelberg, pp. 102-111.
• LJUBIC, I., RAIDL, G.R. and KRATICA, J. (2000). A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. In: Marc Schoenauer, Kalyanmoy Deb, Günther Rudolph, Xin Yao, Evelyne Lutton, Juan Julian Merelo, Hans-Paul Schwefel eds. Parallel Problem Solving from Nature PPSN VI. 1 ed. Springer Berlin Heidelberg, pp. 641-650.

• LJUBIC, I., FURINI, F. and TRAVERSI, E. (2020). Special issue on “Decomposition Methods for Hard Optimization Problems”. Annals of Operations Research, 284(2).
• EHRGOTT, M., LJUBIC, I. and PARRAGH, S.N. (2017). European Journal of Operational Research. European Journal of Operational Research, 260(3).
• DOERNER, K., LJUBIC, I., PFLUG, G. and TRAGLER, G. (2017). Operations Research Proceedings 2015 ISSN: 0721-5924. Operations Research Proceedings.

• MOUACI, A., LJUBIC, I., GOURDIN, E. and PERROT, N. (2020). Virtual Network Functions Placement and Routing Problem: Path formulation. In: 2020 IFIP Networking Conference (Networking). IEEE Xplore, pp. 55-63.
• FURINI, F., LJUBIC, I. and SINNL, M. (2015). ILP and CP Formulations for the Lazy Bureaucrat Problem. In: CPAIOR 2015, LNCS.
• LEITNER, M., LJUBIC, I., SALAZAR-GONZALEZ, J.J. and SINNL, M. (2014). On the Asymmetric Connected Facility Location Polytope. In: ISCO 2014. Springer, pp. 371-383.
• ÁLVAREZ-MIRANDA, E., LJUBIC, I. and MUTZEL, P. (2013). The Rooted Maximum Node-Weight Connected ´ Subgraph Problem. In: CPAIOR 2013. Springer, pp. 300-315.
• LJUBIC, I., MUTZEL, P. and ZEY, B. (2013). Stochastic survivable network design problems. In: Proceedings of INOC 2013. Electronic Notes in Discrete Mathematics (ENDM), pp. 245–252.
• LEITNER, M., LJUBIC, I., SINNL, M. and WERNER, A. (2013). On the two-architecture connected facility location problem. In: Proceedings of INOC 2013. Electronic Notes in Discrete Mathematics (ENDM), pp. 359-366.
• LEITNER, M., LJUBIC, I. and SINNL, M. (2013). Solving the bi-objective prize-collecting Steiner tree problem with the e-constraint method. In: Proceedings of INOC 2013. Electronic Notes in Discrete Mathematics (ENDM), pp. 181-188.
• GOUVEIA, L., LEITNER, M. and LJUBIC, I. (2012). On the hop constrained Steiner tree problem with multiple root nodes. In: Proceedings of the 2nd International Symposium on Combinatorial Optimization. Springer, pp. 201-212.
• GOLLOWITZER, S., GOUVEIA, L. and LJUBIC, I. (2012). Variable neighborhood search for solving the balanced location problem. In: Proceedings of EUROmC XXVIII VNS. Electronic Notes in Discrete Mathematics (ENDM), pp. 21-28.
• ÁLVAREZ-MIRANDA, E., LJUBIC, I. and TOTH, P. (2011). Exact solutions for the robust prize-collecting Steiner tree problem. In: ICUMT 2011, Budapest, Hungary, Proceedings. Institute of Electrical and Electronics Engineers (IEEE), pp. 1-7.
• ARULSELVAN, A., LJUBIC, I., BLEY, A., GOLLOWITZER, S. and MAURER, O. (2011). MIP modeling of incremental connected facility location. In: Proceedings of INOC 2011. Springer, pp. 490-502.
• LJUBIC, I., PUTZ, P. and SALAZAR-GONZALEZ, J.J. (2011). A heuristic algorithm for a prize-collecting local access network design problem. In: Proceedings of INOC 2011. Springer, pp. 139-144.
• GOLLOWITZER, S., LJUBIC, I. and GOUVEIA, L. (2011). A node splitting technique for two level network design problems with transition nodes. In: Proceedings of INOC 2011. Springer, pp. 57-70.
• BOMZE, I.M., LJUBIC, I., CHIMANI, M., JÜNGER, M., MUTZEL, P. and ZEY, B. (2010). Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut. In: Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010). Springer, pp. 427-439.
• LJUBIC, I. and GOLLOWITZER, S. (2010). Modelling the hop constrained connected facility location problem on layered graphs. In: Proceedings of the International Symposium on Combinatorial Optimization (ISCO) 2010. Electronic Notes in Discrete Mathematics (ENDM), pp. 207-214.
• CHIMANI, M., LJUBIC, I., KANDYBA, M. and MUTZEL, P. (2008). Strong formulations for 2-node-connected Steiner network problems. In: Combinatorial Optimization and Applications, Second International Conference, COCOA. Springer, pp. 190-200.
• TOMAZIC, A. and LJUBIC, I. (2008). A GRASP algorithm for the connected facility location problem. In: IEEE/IPSJ International Symposium on Applications and the Internet. Institute of Electrical and Electronics Engineers (IEEE), pp. 257-260.
• CHIMANI, M., KANDYBA, M., LJUBIC, I. and MUTZEL, P. (2008). Obtaining optimal k-cardinality trees fast. In: ALENEX. SIAM, pp. 27-36.
• LJUBIC, I., WEISKIRCHER, R., PFERSCHY, U., KLAU, G., MUTZEL, P. and FISCHETTI, M. (2005). Solving the prize-collecting Steiner tree problem to optimality. In: ALENEX/ANALCO. SIAM, pp. 68-76.
• KLAU, G., LJUBIC, I., MUTZEL, P., PFERSCHY, U. and WEISKIRCHER, R. (2003). The fractional prize collecting Steiner tree problem on trees: Extended abstract. In: ESA. Springer, pp. 691-702.

• ARCHETTI, C., CERULLI, M., FERNANDEZ, E. and LJUBIC, I. (2023). A bilevel pricing and routing problem. In: 24ème Congrès Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2023). Rennes.
• LJUBIC, I., BECK, Y. and SCHMIDT, M. (2023). Bilevel Optimization Under Uncertainty. In: 25th Combinatorial Optimization Workshop in Aussois. Aussois.
• DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. and LJUBIC, I. (2022). Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach. In: International Workshop on Freight Transportation and Logistics (ODYSSEUS). Tanger.
• GAAR, E., LEE, J., LJUBIC, I., SINNL, M. and TANINMIŞ, K. (2022). On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. In: 2023 Optimization at the Second Level. Dagstuhl.
• DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. and LJUBIC, I. (2022). Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach. In: Spanish Conference on Statistics and Operations Research (SEIO). Granada.
• LI, Y., ARCHETTI, C. and LJUBIC, I. (2022). Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates. In: 2022 Italian Operations Research Society (AIRO) (2022 ODS). Florence.
• FURINI, F., LJUBIC, I., SAN SEGUNDO, P. and ZHAO, Y. (2021). The Edge Interdiction Clique Problem. In: 31st European Conference on Operational Research 2021. Athens (virtual).
• ALFANDARI, L., LJUBIC, I. and DE MELO DA SILVA, M. (2021). A tailored Benders Decomposition Approach for Last-Mile Delivery With autonomous Robots. In: 31st European Conference on Operational Research 2021 (EURO 2021). Athens.
• ARCHETTI, C. and LJUBIC, I. (2021). Aggregated Formulations for the Inventory Routing Problem. In: 2021 Optimization in Artificial Intelligence and Data Sciences (ODS). Rome.
• DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. and LJUBIC, I. (2021). Freight on Public Transport: Strategical decision making with mixed integer programming. In: European Conference on Operational Research (EURO). Athens.
• ALFANDARI, L., HASSANZADEH, A. and LJUBIC, I. (2020). Une méthode exacte pour le problème d'assortiment optimal avec modèle de choix nested-logit. In: 21st ROADEF 2020.
• LEITNER, M., LJUBIC, I., RIEDLER, M. and RUTHMAIR, M. (2020). Two Branch-and-cut Algorithms for the Directed Network Design Problem with Relays. In: 15th INFORMS Telecommunications and Network Analytics Conference.
• LJUBIC, I. (2020). Branch-and-Benders-cut algorithms: modern implementations of Benders Decomposition, (Invited Tutorial), In: 9th Winter School on Network Optimization (NetOpt2020). Estoril.
• LJUBIC, I., FURINI, F., MALAGUTI, E. and PARONUZZI, P. (2020). New Integer and Bilevel Formulations for the k-Vertex Cut Problem. In: 22ème séminaire du groupe Polyèdres et Optimisation Combinatoire (POC). Online.
• LJUBIC, I. (2020). Branch-and-Cut Solvers for Mixed-Integer Bilevel Linear Programs. In: Autumn School on Bilevel Optimization. Online.
• LJUBIC, I. (2019). New Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear Programs. In: Séminaire Parisien d'Optimisation.
• FURINI, F., LJUBIC, I., MALAGUTI, E. and PARONUZZI, P. (2019). On Integer and Bilevel Formulations for the k-Vertex Cut Problem. In: 2019 International Network Optimization Conference (INOC 2019).
• ALFANDARI, L., LJUBIC, I. and MELO, M. (2019). Optimal Vehicle Routing with Autonomous Devices for Last-Mile Delivery. In: 2019 Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization (VeRoLog 2019).
• FURINI, F., LJUBIC, I., MALAGUTI, E. and PARONUZZI, P. (2019). A New Bilevel Approach for the K-vertex Cut Problem. In: 2019 INFORMS Annual Meeting.
• FURINI, F., LJUBIC, I., MARTIN, S. and SAN SEGUNDO, P. (2018). Analyzing the Resilience of the Networks with respect to Vertex-Interdiction Attacks. In: 2018 Institute for Operations Research and the Management Sciences (INFORMS) Annual Meeting.
• CORDEAU, J.F., FURINI, F. and LJUBIC, I. (2018). Benders Decomposition for Covering Location Problems. In: 29th European Conference on Operations Research.
• CORDEAU, J.F., FURINI, F. and LJUBIC, I. (2018). Decomposition Approaches to Covering Location Problems. In: 23rd International Symposium on Mathematical Programming (ISMP) 2018.
• LJUBIC, I. (2018). Exact General-Purpose Solvers for Mixed-Integer Bilevel Linear Programs. In: 37ème Journée Francilienne de Recherche Opérationnelle (JFRO).
• ARULSELVAN, A., BLEY, A. and LJUBIC, I. (2018). MIP Modeling of Incremental Connected Facility Location. In: 14th Institute for Operations Research and the Management Sciences (INFORMS) Telecommunications Conference.
• ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. and MARTIN, S. (2018). New MIP models for liner shipping route design with empty container repositionning. In: 4th International Conference on Logistics Operations Management (GOL'2018).
• LEITNER, M., LJUBIC, I., RUTHMAIR, M. and RIEDLER, M. (2018). The Directed Network Design Problem with Relays. In: 7th International Workshop on Freight Transportation and Logistics 2018.
• LJUBIC, I. (2017). A Branch-and-Cut Algorithm for Mixed Integer Bilevel Optimization. In: 21st Combinatorial Optimization Workshop.
• LEITNER, M., LJUBIC, I., LUIPERSBECK, M. and SINNL, M. (2017). A Dual-Ascent-Based Branch-And-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. In: Journées Polyèdres et Optimisation Combinatoire JPOC10.
• LJUBIC, I., FURINI, F., MARTIN, S. and SAN SEGUNDO, P. (2017). Clique Interdiction in the Social Network Analysis. In: International Conference on Network Optimization) INOC 2017.
• LEITNER, M., LJUBIC, I., LUIPERSBECK, M. and SINNL, M. (2017). Decomposition Methods for Stochastic Steiner Trees. In: 2017 European Conference on Stochastic Optimization (ECSO 2017).
• ALFANDARI, L., FURINI, F., LJUBIC, I. and MARTIN, S. (2017). New MIP models for Liner Shipping Route Design with Empty Container Repositioning. In: 18ème Conférence ROADEF de la Société Française de Recherche Opérationnelle et d'Aide à la Décision.
• LJUBIC, I., FURINI, F., MARTIN, S. and SAN SEGUNDO, P. (2017). On Click Interdiction Problems in Graphs. In: 18ème édition du congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, ROADEF2017.
• LJUBIC, I. and MORENO, E. (2017). Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities. In: Optimization 2017 Conference.
• LJUBIC, I. (2017). Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem. In: 22nd edition of the COMEX Belgian Mathematical Optimization Workshop. La-Roche-en-Ardennes.
• ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. and MARTIN, S. (2017). Tighter MIP Formulations for the Barge Container Ship Routing Problem. In: 21st Conference of the International Federation of Operational Research Societies (IFORS).
• FISCHETTI, M., LJUBIC, I., MONACI, M. and SINNL, M. (2016). A New Exact Solver for Mixed-Integer Bilevel Linear Programs Based on Intersection Cuts. In: International Colloquium on Graphs and Optimization 2016 (GO X 2016).
• LEITNER, M., LJUBIC, I., RIEDLER, M. and RUTHMAIR, M. (2016). Exact Approaches for Network Design Problems with Relays. In: 4th International Symposium on Combinatorial Optimization (ISCO 2016).
• FISCHETTI, M., LJUBIC, I. and SINNL, M. (2016). Generalized Benders Cuts for Congested Facility Location. In: 9th Triennial Symposium on Transportation Analysis (TRISTAN16).
• FISCHETTI, M., LJUBIC, I., MONACI, M. and SINNL, M. (2016). Interdiction Games and Monotonicity. In: PGMO Days 2016.
• FISCHETTI, M., LJUBIC, I., MONACI, M. and SINNL, M. (2016). Intersection Cuts for Mixed-Integer Bilevel Linear Programs. In: 28th European Conference on Operational Research.
• FISCHETTI, M., LJUBIC, I. and SINNL, M. (2016). Solving Congested Facility Location by Branch-and-Cut. In: 17eme Congrés Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2016).
• LJUBIC, I., ALVAREZ-MIRANDA, E., LUIPERSBECK, M. and SINNL, M. (2016). Solving Minimum cost Shared Arborescence Problems. In: Thirteenth INFORMS Telecommunications Conference.
• ÁLVAREZ-MIRANDA, E., LJUBIC, I., LUIPERSBECK, M. and SINNL, M. (2016). Solving Minimum-Cost Shared Arborescence Problems. In: 28th European Conference on Operational Research.
• LEITNER, M., LJUBIC, I., LUIPERSBECK, M. and SINNL, M. (2016). Solving Minimum-Cost Shared Arborescence Problems. In: INFORMS Telecommunications Conference 2016.
• CHEN, S., LJUBIC, I. and RAGHAVAN, S. (2016). The Generalized Regenerator Location Problem. In: 13th INFORMS Telecommunications Conference 2016.
• LJUBIC, I., LEITNER, M., RUTHMAIR, M. and RIEDLER, M. (2015). Exact Approaches to the Network Design Problem with Relays. In: OR2015: International Conference on Operations Research.
• LJUBIC, I. (2015). On Benders Decomposition for Facility Location. In: 9ème Journée d’Automne d’Optimisation dans les Réseaux, ROADEF GT d’Optimisation des Réseaux, Institut Henri Poincaré.
• LJUBIC, I. (2015). Exact Approaches to the Network Design Problem with Relays. In: Laboratoire d’informatique de Paris Nord. Paris.
• LJUBIC, I. (2015). The diameter constrained minimum spanning tree problem: Polyhedral study, 2. In: Encontro do Centro de Investigação Operacional, University of Lisbon. Lisbon.
• LJUBIC, I. (2015). A polyhedral study of the diameter constrained minimum spanning tree problem. In: Seminario conjunto ACGO y Matemáticas Discretas, Center of Mathematical Modeling. Santiago.
• LJUBIC, I. (2014). The Recoverable Robust Facility Location Problem. In: Graz Discrete Mathematics and Optimization Seminar, TU Graz. Graz.
• LJUBIC, I. (2013). The Maximum Weight Connected Subgraph Problem: Applications in Bioinformatics. In: The Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine (CIBM), University of Newcastle. Newcastle.
• LJUBIC, I. (2012). Solving 2-Stage Stochastic Network Design Problems by 2-Stage Branch- and-Cut. In: Seminarios CIO, Centro de Investigacao Operacional, Faculdade de Ciencias, Universidade de Lisboa. Lisboa.
• LJUBIC, I. (2012). Optimization Tools for Last Mile Access Networks. In: Colloquium of the Computer Science Department, Faculty of Mathematics and Natural Sciences. Cologne.
• LJUBIC, I. (2012). The Recoverable Robust Two-Level Network Design Problem. In: Kolloquium Optimierung und Operations Research der Wirtschafts- und Sozialwis- senschaftlichen Fakultät, der Fakultät für Informatik und der Fakultät für Mathematik, TU Dortmund. Dortmund.
• LJUBIC, I. (2012). Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch- and-Cut. In: Department of Decision Sciences, I2SDS Seminar, George Washington University. Washington DC.
• LJUBIC, I. (2011). The Generalized Regenerator Location Problem. In: Decision, Operations and Information Technologies Seminar, University of Maryland. Maryland.
• LJUBIC, I. (2010). Dissaggregated Flow Formulation for the Single-Source Network-Loading Problem. In: COGA, TU Berlin.
• LJUBIC, I. (2010). OptTelNets: Algorithmische Ansätze. In: COGA, TU Berlin. Berlin.
• LJUBIC, I. (2010). Two-Stage Branch & Cut for Two-Stage Stochastic Network Design Problems. In: Algorithm Engineering Seminar, Schloss Dagstuhl.
• LJUBIC, I. (2007). Connected facility location in the design of telecommunication networks. In: ISDS-Kolloquium, University of Vienna. Vienna.
• LJUBIC, I. (2006). Optimization in Telecommunication Networks: Multicommodity Flow, Facil- ity Location and Steiner Tree Problems. In: CI-Colloquium, Sonderforschung-bereich Computational Intelligence, University of Dortmund. Dortmund.

• BECK, Y., LJUBIC, I. and SCHMIDT, M. (2022). [Plenary Speaker] Bilevel Optimization Under Uncertainty. In: PGMODays 2022. Palaiseau.
• ALFANDARI, L., LJUBIC, I. and DE MELO DA SILVA, M. (2022). A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots. In: International Conference on Operations Research and Enterprise Systems (ICORES). Online.
• FURINI, F., LJUBIC, I. and SAN SEGUNDO, P. (2022). Lower bounds for Ramsey numbers on circulant graphs. In: Women in Optimization 2022. Berlin.
• ARCHETTI, C. and LJUBIC, I. (2022). Comparison of Formulations for the Inventory Routing Problem. In: 3rd Workshop on Combinatorial Optimization. Online.
• LJUBIC, I. (2021). New Integer and Bilevel Formulations for the k-Vertex Cut Problem, In: 5th AIRO Young Workshop. Napoli (online).
• LJUBIC, I. (2021). [Plenary Speaker] Mixed Integer Bilevel Optimization. In: SIAM Conference on Optimization (OP21). Virtual.
• LJUBIC, I., FURINI, F., MALAGUTI, E. and PARONUZZI, P. (2020). Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. In: Mixed Integer Programming Workshop 2020 Online Edition.
• LJUBIC, I. (2019). From Game Theory to Graph Theory: A Bilevel Journey (EURO 2019 Tutorial). In: 30th European Conference on Operational Research. Dublin.
• LJUBIC, I. (2019). Solving Very Large Scale Covering Location Problems using Branch-and- Benders-Cuts. In: IX International Workshop on Locational Analysis and Related Problems 2019. Cadiz.
• LJUBIC, I. (2018). Very Large Scale Covering Location Problems in the Design of Advanced Metering Infrastructure. In: Workshop on Smart Cities Analytics.
• LJUBIC, I. (2018). [Plenary Speaker] New Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear Programs. In: 2nd International Workshop on Bilevel Programming (IWOBIP'18).
• LJUBIC, I. (2018). [Plenary Speaker] From Game Theory to Graph Theory: A Bilevel Journey. In: International Conference on Operations Research (OR 2018).
• LJUBIC, I. (2018). Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem (Invited Tutorial). In: Winter School on Network Optimization NetOpt2018.
• LJUBIC, I. (2016). [Keynote] A new general-purpose algorithm for mixed-integer bilevel linear programs. In: 15ème Séminaire du Groupe POC "Combinatorial Bi-level optimization".
• LJUBIC, I. (2015). Redesigning Benders Decomposition for Large Scale Facility Location. In: GOM Seminar, Université Libre de Bruxelles. Bruxelles.
• LJUBIC, I. (2015). On optimal design of charging stations for electric vehicles. In: PGMO Seminar, École Polytechnique. Paris.
• LJUBIC, I. (2015). MIP Approaches to the Lazy Bureaucrat and Greedy Boss Problems. In: Séminaire Pôle 2 Optimisation Combinatoire, University Paris Dauphine. Paris.
• LJUBIC, I. (2015). A New Modeling Concept for Facility Location Under Uncertainty. In: Seminar of the Operations Group, Universidad Adolfo Ibanez. Santiago.
• LJUBIC, I. (2012). The Maximum Weight Connected Subgraph Problem. In: COGA Seminar, TU Berlin. Berlin.

• LJUBIC, I., BARAHONA, F., DEY, S.S. and MAHJOUB, A.R. (2022). Preface. In: Combinatorial Optimization. 1st ed. Springer, pp. vi.

• FURINI, F., LJUBIC, I. and TRAVERSI, E. (2020). Preface: decomposition methods for hard optimization problems. Annals of Operations Research, 284(2), pp. 483–485.
• EHRGOTT, M., LJUBIC, I. and PARRAGH, S.N. (2017). EDITORIAL: Feature Cluster: Recent Advances in Exact Methods for Multi-Objective Optimization. European Journal of Operational Research, 260(3), pp. 805-806.

• ALFANDARI, L., HASSANZADEH, A. and LJUBIC, I. (2020). An Exact Method for Assortment Optimization under the Nested Logit Model. ESSEC Business School.
• ALFANDARI, L., LJUBIC, I. and DE MELO DA SILVA, M. (2019). Onlast-mile Delivery with Autonomous Robots. ESSEC Business School.

• ALFANDARI, L., ARCHETTI, C. and LJUBIC, I. (2021). Sustainable city logistics. ESSEC Knowledge.

• LJUBIC, I. (2021). Panel Discussion "Real-World Optimisation Models: Successes and Pitfalls," at the Beale Lecture 2021. Online: