Ivana Ljubic

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 63

Top Venues

Publications

Ivana Ljubic, Miguel A. Pozo, Justo Puerto, Alberto Torrejón
Benders decomposition for the discrete ordered median problem. Eur. J. Oper. Res. 317 (3) (2024)
Yerlan Kuzbakov, Ivana Ljubic
New formulations for two location problems with interconnected facilities. Eur. J. Oper. Res. 314 (1) (2024)
Alice Calamita, Ivana Ljubic, Laura Palagi
Benders decomposition for congested partial set covering location with uncertain demand. CoRR (2024)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. Math. Program. 206 (1) (2024)
Fotios Petropoulos, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao
Operational Research: methods and applications. J. Oper. Res. Soc. 75 (3) (2024)
Yasmine Beck, Ivana Ljubic, Martin Schmidt
A survey on bilevel optimization under uncertainty. Eur. J. Oper. Res. 311 (2) (2023)
Martina Cerulli, Domenico Serra, Carmine Sorgente, Claudia Archetti, Ivana Ljubic
Mathematical programming formulations for the Collapsed k-Core Problem. Eur. J. Oper. Res. 311 (1) (2023)
Ahlam Mouaci, Éric Gourdin, Ivana Ljubic, Nancy Perrot
Two extended formulations for the virtual network function placement and routing problem. Networks 82 (1) (2023)
Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
An exact method for binary fortification games. Eur. J. Oper. Res. 307 (3) (2023)
Cristian Ramirez-Pico, Ivana Ljubic, Eduardo Moreno
Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs. Transp. Sci. 57 (5) (2023)
Yasmine Beck, Ivana Ljubic, Martin Schmidt
Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem. Math. Program. Comput. 15 (4) (2023)
Yuanyuan Li, Claudia Archetti, Ivana Ljubic
Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates. CoRR (2022)
Laurent Alfandari, Ivana Ljubic, Marcos de Melo da Silva
A tailored Benders decomposition approach for last-mile delivery with autonomous robots. Eur. J. Oper. Res. 299 (2) (2022)
Elena Fernández, Markus Leitner, Ivana Ljubic, Mario Ruthmair
Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption. Transp. Sci. 56 (5) (2022)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. CoRR (2022)
Claudia Archetti, Ivana Ljubic
Comparison of formulations for the Inventory Routing Problem. Eur. J. Oper. Res. 303 (3) (2022)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. IPCO (2022)
Stefano Coniglio, Fabio Furini, Ivana Ljubic
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. Math. Program. 196 (1) (2022)
Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. Oper. Res. 70 (4) (2022)
Ivana Ljubic
A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots. ICORES (2022)
Milad Keshvari Fard, Ivana Ljubic, Felix Papier
Budgeting in International Humanitarian Organizations. Manuf. Serv. Oper. Manag. 24 (3) (2022)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. CoRR (2021)
Eduardo Álvarez-Miranda, Marcos Goycoolea, Ivana Ljubic, Markus Sinnl
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. Eur. J. Oper. Res. 289 (3) (2021)
Laurent Alfandari, Alborz Hassanzadeh, Ivana Ljubic
An exact method for assortment optimization under the nested logit model. Eur. J. Oper. Res. 291 (3) (2021)
Fabio Furini, Ivana Ljubic, Pablo San Segundo, Yanlu Zhao
A branch-and-cut algorithm for the Edge Interdiction Clique Problem. Eur. J. Oper. Res. 294 (1) (2021)
Thomas Kleinert, Martine Labbé, Ivana Ljubic, Martin Schmidt
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. EURO J. Comput. Optim. 9 (2021)
Ivana Ljubic, Ahlam Mouaci, Nancy Perrot, Éric Gourdin
Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem. Comput. Oper. Res. 130 (2021)
Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
An Exact Method for Fortification Games. CoRR (2021)
Ivana Ljubic
Solving Steiner trees: Recent advances, challenges, and perspectives. Networks 77 (2) (2021)
Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi
-vertex cut problem. Math. Program. Comput. 12 (2) (2020)
Fabio Furini, Ivana Ljubic, Emiliano Traversi
Preface: decomposition methods for hard optimization problems. Ann. Oper. Res. 284 (2) (2020)
Georg Brandstätter, Markus Leitner, Ivana Ljubic
Location of Charging Stations in Electric Car Sharing Systems. Transp. Sci. 54 (5) (2020)
Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
A polyhedral study of the diameter constrained minimum spanning tree problem. Discret. Appl. Math. 285 (2020)
Ahlam Mouaci, Éric Gourdin, Ivana Ljubic, Nancy Perrot
Virtual Network Functions Placement and Routing Problem: Path formulation. Networking (2020)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
Interdiction Games and Monotonicity, with Application to Knapsack Problems. INFORMS J. Comput. 31 (2) (2019)
Ashwin Arulselvan, Andreas Bley, Ivana Ljubic
The incremental connected facility location problem. Comput. Oper. Res. 112 (2019)
Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic
A new branch-and-bound algorithm for the maximum edge-weighted clique problem. Eur. J. Oper. Res. 278 (1) (2019)
Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair
Exact Approaches for Network Design Problems with Relays. INFORMS J. Comput. 31 (1) (2019)
Fabio Furini, Ivana Ljubic, Sébastien Martin, Pablo San Segundo
The maximum clique interdiction problem. Eur. J. Oper. Res. 277 (1) (2019)
Jean-François Cordeau, Fabio Furini, Ivana Ljubic
Benders decomposition for very large scale partial set covering and maximal covering location problems. Eur. J. Oper. Res. 275 (3) (2019)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
On the use of intersection cuts for bilevel optimization. Math. Program. 172 (1-2) (2018)
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. INFORMS J. Comput. 30 (2) (2018)
Ivana Ljubic, Eduardo Moreno
Outer approximation and submodular cuts for maximum capture facility location problems with random utilities. Eur. J. Oper. Res. 266 (1) (2018)
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
Decomposition methods for the two-stage stochastic Steiner tree problem. Comput. Optim. Appl. 69 (3) (2018)
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
The connected facility location polytope. Discret. Appl. Math. 234 (2018)
Andreas Bley, Ivana Ljubic, Olaf Maurer
A node-based ILP formulation for the node-weighted dominating Steiner problem. Networks 69 (1) (2017)
Matteo Fischetti, Ivana Ljubic, Markus Sinnl
Redesigning Benders Decomposition for Large-Scale Facility Location. Manag. Sci. 63 (7) (2017)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. Oper. Res. 65 (6) (2017)
Matthias Ehrgott, Ivana Ljubic, Sophie N. Parragh
Feature cluster: Recent advances in exact methods for multi-objective optimisation. Eur. J. Oper. Res. 260 (3) (2017)
Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl
Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9 (2) (2017)
Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
Solving minimum-cost shared arborescence problems. Eur. J. Oper. Res. 258 (3) (2017)
Ivana Ljubic, Petra Mutzel, Bernd Zey
Stochastic survivable network design problems: Theory and practice. Eur. J. Oper. Res. 256 (2) (2017)
Fabio Furini, Ivana Ljubic, Markus Sinnl
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. Eur. J. Oper. Res. 262 (2) (2017)
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
An algorithmic framework for the exact solution of tree-star problems. Eur. J. Oper. Res. 261 (1) (2017)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
Intersection Cuts for Bilevel Optimization. IPCO (2016)
Markus Sinnl, Ivana Ljubic
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints. Math. Program. Comput. 8 (4) (2016)
Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design. Comput. Oper. Res. 72 (2016)
Matteo Fischetti, Ivana Ljubic, Markus Sinnl
Benders decomposition without separability: A computational study for capacitated facility location problems. Eur. J. Oper. Res. 253 (3) (2016)
Markus Leitner, Ivana Ljubic, Markus Sinnl
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem. INFORMS J. Comput. 27 (1) (2015)
Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
The two-level diameter constrained spanning tree problem. Math. Program. 150 (1) (2015)
Fabio Furini, Ivana Ljubic, Markus Sinnl
ILP and CP Formulations for the Lazy Bureaucrat Problem. CPAIOR (2015)
Eduardo Álvarez-Miranda, Ivana Ljubic, S. Raghavan, Paolo Toth
The Recoverable Robust Two-Level Network Design Problem. INFORMS J. Comput. 27 (1) (2015)
Si Chen, Ivana Ljubic, S. Raghavan
The Generalized Regenerator Location Problem. INFORMS J. Comput. 27 (2) (2015)
Ivana Ljubic, Peter Putz, Juan José Salazar González
A MIP-based approach to solve the prize-collecting local access network design problem. Eur. J. Oper. Res. 235 (3) (2014)
Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
Hop constrained Steiner trees with multiple root nodes. Eur. J. Oper. Res. 236 (1) (2014)
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Max Resch
A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs. Hybrid Metaheuristics (2014)
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
On the Asymmetric Connected Facility Location Polytope. ISCO (2014)
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. Eur. J. Oper. Res. 225 (2) (2013)
Ivana Ljubic, Petra Mutzel, Bernd Zey
Stochastic Survivable Network Design Problems. Electron. Notes Discret. Math. 41 (2013)
Eduardo Álvarez-Miranda, Ivana Ljubic, Petra Mutzel
The Rooted Maximum Node-Weight Connected Subgraph Problem. CPAIOR (2013)
Andreas Bley, Ivana Ljubic, Olaf Maurer
Lagrangian decompositions for the two-level FTTx network design problem. EURO J. Comput. Optim. 1 (3-4) (2013)
Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner
On the Two-Architecture Connected Facility Location Problem. Electron. Notes Discret. Math. 41 (2013)
Ivana Ljubic, Stefan Gollowitzer
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem. INFORMS J. Comput. 25 (2) (2013)
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR 11 (4) (2013)
Stefan Gollowitzer, Bernard Gendron, Ivana Ljubic
A cutting plane algorithm for the Capacitated Connected Facility Location Problem. Comput. Optim. Appl. 55 (3) (2013)
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
Exact approaches for solving robust prize-collecting Steiner tree problems. Eur. J. Oper. Res. 229 (3) (2013)
Markus Leitner, Ivana Ljubic, Markus Sinnl
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method. Electron. Notes Discret. Math. 41 (2013)
Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. ISCO (2012)
Ivana Ljubic, Peter Putz, Juan José Salazar González
Exact approaches to the single-source network loading problem. Networks 59 (1) (2012)
Jozef Kratica, Markus Leitner, Ivana Ljubic
Variable Neighborhood Search for Solving the Balanced Location Problem. Electron. Notes Discret. Math. 39 (2012)
Stefan Gollowitzer, Ivana Ljubic
MIP models for connected facility location: A theoretical and computational study. Comput. Oper. Res. 38 (2) (2011)
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes. INOC (2011)
Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer
MIP Modeling of Incremental Connected Facility Location. INOC (2011)
Ivana Ljubic, Peter Putz, Juan José Salazar González
A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem. INOC (2011)
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
Exact solutions for the robust prize-collecting steiner tree problem. ICUMT (2011)
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic
The Two Level Network Design Problem with Secondary Hop Constraints. INOC (2011)
Si Chen, Ivana Ljubic, S. Raghavan
The regenerator location problem. Networks 55 (3) (2010)
Ivana Ljubic, Stefan Gollowitzer
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs. Electron. Notes Discret. Math. 36 (2010)
Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. ISAAC (1) (2010)
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice. Math. Program. 124 (1-2) (2010)
Ivana Ljubic
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. Networks 56 (3) (2010)
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel
-cardinality trees fast. ACM J. Exp. Algorithmics 14 (2009)
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel
Strong Formulations for 2-Node-Connected Steiner Network Problems. COCOA (2008)
Alessandro Tomazic, Ivana Ljubic
A GRASP Algorithm for the Connected Facility Location Problem. SAINT (2008)
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel
Obtaining Optimal k-Cardinality Trees Fast. ALENEX (2008)
Ivana Ljubic
A Hybrid VNS for Connected Facility Location. Hybrid Metaheuristics (2007)
Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. 105 (2-3) (2006)
Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO (2005)
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) (2004)
Jozef Kratica, Ivana Ljubic, Dusan Tosic
A Genetic Algorithm for the Index Selection Problem. EvoWorkshops (2003)

Ivana Ljubic.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ivana Ljubic