Ivana Ljubić

Ivana Ljubić

Auto-generated profile, based on publicly available information

Ivana Ljubić

ESSEC Business School Cergy‐Pontoise France

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2021 in EURO Journal on Computational Optimization
Verified
Journal Article
Open access
TKThomas Kleinert
Thomas Kleinert
MLMartine Labbé
Martine Labbé
ILIvana Ljubić
Ivana Ljubić
MSMartin Schmidt
Martin Schmidt

1 July 2017 in Management Science
Verified
Journal Article
Closed access
MFMatteo Fischetti
Matteo Fischetti
ILIvana Ljubić
Ivana Ljubić
MSMarkus Sinnl
Markus Sinnl
The uncapacitated facility location (UFL) problem is one of the most famous and most studied problems in the operations research literature. Given a set of potential facility locations and a set of customers, the goal is to find a subset of facility locations to open and to allocate each customer to open facilities so that the facility opening plus customer allocation costs are minimized. In our setting, for each customer the allocation cost is assumed to be a linear or separable convex quadratic function. Motivated by recent UFL applications in business analytics, we revise approaches that work on a projected decision space and hence are intrinsically more scalable for large-scale input data. Our working hypothesis is that many of the exact (decomposition) approaches that were proposed decades ago and discarded soon after need to be redesigned to take advantage of the new hardware and software technologies. To this end, we “thin out” the classical models from the literature and use (generalized) Benders cuts to replace a huge number of allocation variables by a small number of continuous variables that model the customer allocation cost directly. Our results show that Benders decomposition allows for a significant boost in the performance of a mixed-integer programming solver. We report the optimal solution of a large set of previously unsolved benchmark instances widely used in the available literature. In particular, dramatic speedups are achieved for UFL problems with separable quadratic allocation costs, which turn out to be much easier than their linear counterparts when our approach is used. This paper was accepted by Yinyu Ye, optimization.

1 December 2017 in Operations Research
Verified
Journal Article
Closed access
MFMatteo Fischetti
Matteo Fischetti
ILIvana Ljubić
Ivana Ljubić
MMMichele Monaci
Michele Monaci
MSMarkus Sinnl
Markus Sinnl
Bilevel optimization problems are very challenging optimization models arising in many important practical contexts, including pricing mechanisms in the energy sector, airline and telecommunication industry, transportation networks, critical infrastructure defense, and machine learning. In this paper, we consider bilevel programs with continuous and discrete variables at both levels, with linear objectives and constraints (continuous upper level variables, if any, must not appear in the lower level problem). We propose a general-purpose branch-and-cut exact solution method based on several new classes of valid inequalities, which also exploits a very effective bilevel-specific preprocessing procedure. An extensive computational study is presented to evaluate the performance of various solution methods on a common testbed of more than 800 instances from the literature and 60 randomly generated instances. Our new algorithm consistently outperforms (often by a large margin) alternative state-of-the-art methods from the literature, including methods exploiting problem-specific information for special instance classes. In particular, it solves to optimality more than 300 previously unsolved instances from the literature. To foster research on this challenging topic, our solver is made publicly available online. The online appendix is available at https://doi.org/10.1287/opre.2017.1650 .

12 October 2005 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
ILIvana Ljubić
Ivana Ljubić
RWRené Weiskircher
René Weiskircher
UPUlrich Pferschy
Ulrich Pferschy
GKGunnar Klau
Gunnar Klau
PMPetra Mutzel
Petra Mutzel
MFMatteo Fischetti
Matteo Fischetti

2 February 2023 in European Journal of Operational Research
Verified
Journal Article
Open access
YBYasmine Beck
Yasmine Beck
ILIvana Ljubić
Ivana Ljubić
MSMartin Schmidt
Martin Schmidt

1 June 2019 in European Journal of Operational Research
Verified
Journal Article
Closed access
JCJean-François Cordeau
Jean-François Cordeau
FFFabio Furini
Fabio Furini
ILIvana Ljubić
Ivana Ljubić