T. Kleinert, M. Labbé, I. Ljubic, M. Schmidt.
Survey on Mixed-Integer Programming Techniques in Bilevel Optimization,
submitted 2021 (preprint)
F. Furini, I. Ljubic, P. San Segundo, Y. Zhao,
A branch-and-cut algorithm for the Edge Interdiction
Clique Problem, submitted 2020 (preprint)
S. Coniglio, F. Furini, I. Ljubic,
Maximizing submodular utility functions combined with a set-union operator over a discrete set, submitted 2020 (Technical Report)
L. Alfandari, I. Ljubic, M. Melo da Silva.
On Last-Mile Delivery with Autonomous Robots, submitted 2019
E. Fernández, M. Leitner, I. Ljubic, and M. Ruthmair.
Arc routing with electric vehicles: dynamic charging and
speed-dependent energy consumption, submitted 2020 (Technical Report).
I. Ljubic, A. Mouaci, N. Perrot, E. Gourdin:
Benders decomposition for a node-capacitated virtual network functions placement and routing problem, Computers and Operations Research, to appear, 2021
L. Alfandari, A. Hassanzadeh, I. Ljubic:
An Exact Method for Assortment Optimization under the Nested Logit Model, European Journal of Operational Research, to appear, 2021 (Technical Report)
I. Ljubic and G. R. Raidl:
A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs. Journal of Heuristics, 9(5):401-428, 2003.
Previous technical report.
G. R. Raidl and I. Ljubic:
Evolutionary local search for the edge-biconnectivity augmentation problem. Information Processing Letters, 82(1):39-45, 2002.
Previous technical report.
J. Kratica, D. Tosic, V. Filipovic, and I. Ljubic:
Solving the simple plant location problem by genetic algorithms. RAIRO - Operations Research, 35(1):127-142, 2001.
E. Alvarez-Miranda, I. Ljubic, P. Mutzel The Rooted Maximum Node-Weight Connected Subgraph Problem CPAIOR 2013,
Volume 7874 of Lecture Notes in Computer Science, pp. 300-315, 2013
(preprint)
I. Ljubic, S. Gollowitzer Modelling the Hop Constrained Connected
Facility Location Problem on Layered Graphs, ISCO 2010,
Electronic Notes in Discrete Mathematics 36 (2010), 207-214
(preprint)
I. Ljubic. P. Putz, J.J. Salazar Exact Approaches to the Single-Source Network Loading Problem INOC 2009
I. Ljubic and J. Kratica A genetic algorithm for the biconnectivity augmentation problem.
IEEE Congress on Evolutionary Computation 2000,
IEEE Press, pp. 89-96, 2000.
PhD Thesis
Ivana Ljubic Exact and Memetic Algorithms for Two Network Design Problems.
PhD thesis, Faculty of Computer Science, Vienna University of Technology, November 2004.
2.6MB (PDF-file).