Ivana Ljubic
Professor, Information Systems, Decision Sciences and Statistics (IDS) Department

Photo de Ivana Ljubic
Curriculum Vitae (pdf)
General Information Research Areas Publications Teaching Other Activities

Habilitation in Operations Research, University of Vienna

PhD in Computer Science, Vienna University of Technology


Ivana Ljubic teaches Operations Research (OR), Business Mathematics and Optimal Decision Making 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. 

Research interests and main competences of Ivana Ljubic include combinatorial optimization and optimization under uncertainty. 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 30 articles in leading OR journals, including Management Science, Mathematical Programming, INFORMS JOC, European Journal of Operational Research.
She is a member of Editorial Advisory Board for the journal Computers & Operations Research and Associate Editor for the journal Omega. She also served as guest-editor of journals: European Journal of Operational Research and Annals of Operations Research.
She was also member of the executive board of the Austrian OR Society (OEGOR), and she currently serves as vice-president of the INFORMS Telecommunication Section.

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


See my full publication list including preprints. 

See my Google Scholar Profile.

Complete list of scientific activities.

Research Areas

Network Design

Combinatorial Optimization

Optimization under Uncertainty

Biobjective Optimization

Mixed Integer (Non-linear) Programming



Design of Telecommunication Networks

Smart Cities

Facility Location

Design of Data and Distribution Networks


Social Networks

On-going Projects

e4-share (Models for Ecological, Economical, Efficient, Electric Car-Sharing), with Uni Wien, ULB and Uni Bolog.

Network Optimization in Bioinformatics and Systems Biology, with Uni Wien (funded by FWF)

Multi-Criteria Optimization of FTTx Network, with Uni Wien, ZIB Berlin (funded by FWF, DFG)



Academic Publications
  "The connected facility location polytope" (M. Leitner, I. Ljubic, JJ. Salazar‑Gonzales, M. Sinnl), Discrete Applied Mathematics, Issue tba
  " Redesigning Benders Decomposition for Large Scale Facility Location" (I. Ljubic, M. Fischetti, M. Sinnl), Management Science, Issue tba
  "Benders decomposition without separability: a computational study for capacitated facility location problems" (I. Ljubic, M. Fischetti, M. Sinnl), European Journal of Operational Research, Issue 3
  " A Node-Based Layered Graph Approach for the Steiner Tree Problem with Revenues, Budget and Hop-Constraints" (I. Ljubic, M. Sinnl), Mathematical Programming Computation, Issue -
  "ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design" (M. Leitner, I. Ljubic, M. Sinnl, A. Werner), Computers and OR
  "The recoverable robust facility location problem" (E. Álvarez‑Miranda, E. Fernández, I. Ljubic, ), Transportation Research, Sep 2015, Vol. 79, Issue 1, p. 93‑120
  "The Two-Level Diameter Constrained Spanning Tree Problem" (L. Gouveia, M. Leitner, I. Ljubic), Mathematical Programming, Apr 2015, Vol. 150, Issue 1, p. 49‑78
  "The Generalized Regenerator Location Problem" (S. Chen, I. Ljubic, S. Raghavan), INFORMS Journal of Computing, Mar 2015, Vol. 27, Issue 2, p. 204‑220
  " The bi-objective prize-collecting Steiner tree problem" (M. Leitner, I. Ljubic, M. Sinnl), INFORMS Journal on Computing, Dec 2014, Vol. 27, Issue 1, p. 118‑134
  "The Recoverable Robust Two-Level Network Design Problem" (E. Alvarez‑Miranda, I. Ljubic, S. Raghavan), INFORMS Journal on Computing, Sep 2014, Vol. 27, Issue 1, p. 1‑19
  "Hop constrained Steiner trees with multiple root nodes" (L. Gouveia, M. Leitner, I. Ljubic), European Journal of Operational Research, Jul 2014, Vol. 236, Issue 1
  " A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem " (I. Ljubic, P. Putz, JJ. Salazar6gonzalez), European Journal of Operational Research, Jun 2014, Vol. 235, Issue 3, p. 727‑739
  "A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems" (E. Alvarez‑Miranda, I. Ljubic, P. Toth), 4OR, Dec 2013, Vol. 11, Issue 4, p. 349‑360
  "Lagrangian decompositions for the two-level FTTx network design problem" (A. Bley, I. Ljubic, O. Maurer), EURO Journal on Computational Optimization, Nov 2013, Vol. 1, Issue 3, p. 221‑252
  "Exact Approaches for Solving Robust Prize-Collecting Steiner Tree Problems, European Journal of Operational Research" (E. Alvarez‑Miranda, I. Ljubic, P. Toth), European Journal of Operational Research, Sep 2013, Vol. 229, Issue 3, p. 599‑612
  "A cutting plane algorithm for the Capacitated Connected Facility Location Problem" (S. Gollowitzer, B. Gendron, I. Ljubic), Computational Optimization and Applications, Jul 2013, Vol. 55, Issue 3, p. 647‑674
  " Enhanced Formulations and Branch-and-Cut for the Two Level Network Design Problem with Transition Facilities" (S. Gollowitzer, L. Gouveia, I. Ljubic), European Journal of Operational Research, Mar 2013, Vol. 225, Issue 2, p. 211‑222
  "QTL Mapping Using a Memetic Algorithm with Modifications of BIC as Fitness Function" (F. Frommlet, I. Ljubic, H. Björk Arnardóttir, M. Bogdan), Statistical applications in Genetics and Molecular Biology, May 2012, Vol. 11, Issue 4, p. Art. 2
  "Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem, 25(2): 256-270, 2013 Technical Report Nr. [2010-08]," (I. Ljubic, S. Gollowitzer), INFORMS Journal on Computing, Apr 2012, Vol. 25, Issue 2, p. 256‑270
  "Exact approaches to the single-source network loading problem" (I. Ljubic, P. Putz, JJ. Salazar‑Gonzalez), Networks, Jan 2012, Vol. 59, Issue 1, p. 89‑106
  "MIP models for connected facility location: A theoretical and computational study" (S. Gollowitzer, I. Ljubic), Computers and OR, Feb 2011, Vol. 38, Issue 2, p. 435‑449
  "A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation" (I. Ljubic), Networks, Oct 2010, Vol. 56, Issue 3, p. 169‑182
  "Orientation-based models for {0,1,2}-survivable network design: theory and practice" (M. Chimani, M. Kandyba, I. Ljubic, P. Mutzel), Mathematical Programming Series A & B, Jul 2010, Vol. 124, Issue 1, p. 413‑440
  "The regenerator location problem" (I. Ljubic, S. Chen), Networks, May 2010, Vol. 55, Issue 3, p. 205‑220
  "Obtaining optimal k-cardinality trees fast" (I. Ljubic, M. Chimani, M. Kandyba, P. Mutzel), ACM Journal of Experimental Algorithmics, Jan 2009, Vol. 14, Issue 5, p. 5.1‑5.23
  "An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem" (I. Ljubic, R. Weiskircher, U. Pferschy, G. Klau, P. Mutzel, M. Fischetti), Mathematical Programming, Feb 2006, Vol. 105, Issue 2, p. 427‑449
  "A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs" (I. Ljubic, G. Raidl), Journal of Heuristics, Jan 2003, Vol. 9, Issue 5, p. 401‑428
  "Evolutionary Local Search for the Edge-Biconnectibity Augmentation Problem" (G. Raidl, I. Ljubic), Information Processing Letters, Jan 2002, Vol. 82, Issue 1, p. 39‑45
  "Solving the simple plant location problem by genetic algorithms" (J. Kratica, D. Tosic, V. Filipovic, I. Ljubic), RAIRO Operations Research, Jan 2001, Vol. 35, Issue 1, p. 127‑142

  Intersection Cuts for Bilevel Optimization. In: Integer Programming and Combinatorial Optimization (with M. Fischetti, M. Monaci, M. Sinnl). Berlin (Germany) : Springer Lecture Notes in Computer Science, Quentin Louveaux, Martin Skutella . 2016, p. 77-88
  The Maximum Weight Connected Subgraph Problem. In: Facets of Combinatorial Optimization (with E. Alvarez-Miranda, P. Mutzel). : Springer, Michael Jünger, Gerhard Reinelt. 2013, p. 245-270

Teaching at ESSEC

Optmization for Decision Making, Grand Ecole Program (core course)

Business Mathematics & Statistics, Grand Ecole Program  Introduction to Optimization Methods (PhD Program)


Other Teaching Activities

Networks: Design and Analysis (Vienna University of Technology)


Former teaching activiteis at the University of Vienna:

Graph Algorithms and Network Flows

Operations Research 2

Introduction to Business Mathematics

Business Mathematics 1

Business Mathematics 2



Awards and Distinctions

2016: Best paper award of the INFORMS Telecommunication Section for the paper The Generalized Regenerator Location Problem, INFORMS Journal on Computing 27(2): 204 - 220, 2015 (with S. Chen, S. Raghavan).

2014: Winner of the DIMACS implementation challenge on Steiner trees (with M. Fischetti et al.)

2014: Finalist for the best paper award of the INFORMS Telecommunication Section (with L. Gouveia, M. Leitner)

APART Fellowship of the Austrian Academy of Sciences (2011-2013)

Hertha-Firnberg Post-Doc Fellowship of the Austrian Science Fund (2007-2010) 

PhD award of Austrian Society for Operations Research (2005)

PhD Fellowship of Austrian Academy of Sciences (DOC Fellowship, 2003-2004)

Scientific Activities
Editorial Board Membership
  Computers and Operations Research, Elsevier

Direction of a collective book
  Operations Research Proceedings 2015. (avec K. Doerner, G. Tragler, G. Pflug, ). : Springer Verlag, 2016

Conference Presentations

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

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

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

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

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

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


Affiliations and Academic Responsibilities

2014-2016: INFORMS Telecom Section, Secretary,

2014-2015 and 2006-2008: Member of the executive board of the Austrian Society of Operations Research OEGOR),


Recent invited talks:

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

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

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

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

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

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

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

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





Consulting & Other Activities

OptTelNets, project with Telecom Austria A1 (2007 - 2010)

FSC Siemens, portfolio optimization (2005-2007)

Professional Experience

Recent activities as the program committee member:

European Conference on Operational Research, EURO 2016, Poznan, Poland

International Network Optimization Conference, INOC 2015, Warsaw, Poland

International Symposium on Combinatorial Optimization, ISCO 2014, Lisbon, Portuga

INFORMS Telecommunication Conference 2014, Lisbon, Portugal


Recent co-organization of conferences & workshops:

OR2015, Vienna, Austria, Sept 1-4, 2015

Workshop “Recent Advances in Multi-Objective Optimization”, 2014 University of Vienna, Austria

Workshop “Routing and Networks”, University of Vienna, 2014, Austria



Useful Links
Information Systems, Decision Sciences and Statistics (IDS)
Tel: +33 1 34 43 97 26

ESSEC Business School
Av. Bernard Hirsch
B.P. 50105
95021 Cergy Pontoise Cedex

This website uses cookies. By continuing to browse this site, we will assume that you consent to the use of cookies. Find out more about cookies.

Help Me Choose a program