Ivana Ljubic
Ivana Ljubic
Professor of Operations Research, ESSEC Business School, Paris
Verified email at essec.edu - Homepage
Cited by
Cited by
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
I Ljubić, R Weiskircher, U Pferschy, GW Klau, P Mutzel, M Fischetti
Mathematical programming 105 (2), 427-449, 2006
Solving the simple plant location problem by genetic algorithm
J Kratica, D Tošic, V Filipović, I Ljubić
RAIRO-Operations Research-Recherche Opérationnelle 35 (1), 127-142, 2001
The regenerator location problem
S Chen, I Ljubić, S Raghavan
Networks: An International Journal 55 (3), 205-220, 2010
Redesigning Benders decomposition for large-scale facility location
M Fischetti, I Ljubić, M Sinnl
Management Science 63 (7), 2146-2162, 2017
MIP models for connected facility location: A theoretical and computational study
S Gollowitzer, I Ljubić
Computers & Operations Research 38 (2), 435-449, 2011
A new general-purpose algorithm for mixed-integer bilevel linear programs
M Fischetti, I Ljubić, M Monaci, M Sinnl
Operations Research 65 (6), 1615-1637, 2017
Benders decomposition without separability: A computational study for capacitated facility location problems
M Fischetti, I Ljubić, M Sinnl
European Journal of Operational Research 253 (3), 557-569, 2016
Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem
GW Klau, I Ljubić, A Moser, P Mutzel, P Neuner, U Pferschy, G Raidl, ...
Genetic and Evolutionary Computation Conference, 1304-1315, 2004
Thinning out Steiner trees: a node-based model for uniform edge costs
M Fischetti, M Leitner, I Ljubić, M Luipersbeck, M Monaci, M Resch, ...
Mathematical Programming Computation 9 (2), 203-229, 2017
A genetic algorithm for the index selection problem
J Kratica, I Ljubić, D Tošić
Workshops on Applications of Evolutionary Computation, 280-290, 2003
The maximum weight connected subgraph problem
E Álvarez-Miranda, I Ljubić, P Mutzel
Facets of Combinatorial Optimization, 245-270, 2013
On the use of intersection cuts for bilevel optimization
M Fischetti, I Ljubić, M Monaci, M Sinnl
Mathematical Programming 172 (1), 77-103, 2018
Exact and memetic algorithms for two network design problems
I Ljubić
Layered graph approaches to the hop constrained connected facility location problem
I Ljubić, S Gollowitzer
INFORMS Journal on Computing 25 (2), 256-270, 2013
Solving the prize-collecting Steiner tree problem to optimality
I Ljubic, R Weiskircher, U Pferschy, GW Klau, P Mutzel, M Fischetti
ALENEX/ANALCO 2005, 68-76, 2005
Interdiction Games and Monotonicity, with Application to Knapsack Problems
M Fischetti, I Ljubic, M Monaci, M Sinnl
INFORMS Journal on Computing, 2019, 2016
A hybrid VNS for connected facility location
I Ljubić
International Workshop on Hybrid Metaheuristics, 157-169, 2007
Obtaining optimal k-cardinality trees fast
M Chimani, M Kandyba, I Ljubić, P Mutzel
Journal of Experimental Algorithmics (JEA) 14, 2.5-2.23, 2010
Exact approaches to the single‐source network loading problem
I Ljubić, P Putz, JJ Salazar‐González
Networks 59 (1), 89-106, 2012
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
S Gollowitzer, L Gouveia, I Ljubić
European Journal of Operational Research 225 (2), 211-222, 2013
The system can't perform the operation now. Try again later.
Articles 1–20