A genetic algorithm for the biconnectivity augmentation problem. - Ivana D. Ljubic; Jozef J. Kratica (CEC, 2000)

A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. - Ivana Ljubic; Günther R. Raidl; Jozef Kratica (PPSN, 2000)

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem. - Ivana Ljubic; Günther R. Raidl (EvoWorkshops, 2001)

Solving the simple plant location problem by genetic algorithm. - Jozef Kratica; Dusan Tosic; Vladimir Filipovic; Ivana Ljubic (RAIRO Oper. Res., 2001)

A Memetic Algorithm for Vertex-Biconnectivity Augmentation. - Sandor Kersting; Günther R. Raidl; Ivana Ljubic (EvoWorkshops, 2002)

Evolutionary local search for the edge-biconnectivity augmentation problem. - Günther R. Raidl; Ivana Ljubic (Inf. Process. Lett., 2002)

The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. - Gunnar W. Klau; Ivana Ljubic; Petra Mutzel; Ulrich Pferschy; René Weiskircher (ESA, 2003)

A Genetic Algorithm for the Index Selection Problem. - Jozef Kratica; Ivana Ljubic; Dusan Tosic (EvoWorkshops, 2003)

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. - Ivana Ljubic; Günther R. Raidl (J. Heuristics, 2003)

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. - Gunnar W. Klau; Ivana Ljubic; Andreas Moser; Petra Mutzel; Philipp Neuner; Ulrich Pferschy; Günther R. Raidl; René Weiskircher (GECCO (1), 2004)

Solving the Prize-Collecting Steiner Tree Problem to Optimality. - Ivana Ljubic; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; Matteo Fischetti (ALENEX/ANALCO, 2005)

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. - Ivana Ljubic; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; Matteo Fischetti (Math. Program., 2006)

A Hybrid VNS for Connected Facility Location. - Ivana Ljubic (Hybrid Metaheuristics, 2007)

Obtaining Optimal k-Cardinality Trees Fast. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (ALENEX, 2008)

Strong Formulations for 2-Node-Connected Steiner Network Problems. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (COCOA, 2008)

A GRASP Algorithm for the Connected Facility Location Problem. - Alessandro Tomazic; Ivana Ljubic (SAINT, 2008)

Obtaining optimal k-cardinality trees fast. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (ACM J. Exp. Algorithmics, 2009)

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. - Immanuel M. Bomze; Markus Chimani; Michael Jünger; Ivana Ljubic; Petra Mutzel; Bernd Zey (ISAAC (1), 2010)

Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs. - Ivana Ljubic; Stefan Gollowitzer (Electron. Notes Discret. Math., 2010)

Orientation-based models for {0, 1, 2}-survivable network design: theory and practice. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (Math. Program., 2010)

The regenerator location problem. - Si Chen; Ivana Ljubic; S. Raghavan 001 (Networks, 2010)

A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. - Ivana Ljubic (Networks, 2010)

Exact solutions for the robust prize-collecting steiner tree problem. - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (ICUMT, 2011)

MIP Modeling of Incremental Connected Facility Location. - Ashwin Arulselvan; Andreas Bley; Stefan Gollowitzer; Ivana Ljubic; Olaf Maurer (INOC, 2011)

A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes. - Stefan Gollowitzer; Luis Eduardo Neves Gouveia; Ivana Ljubic (INOC, 2011)

The Two Level Network Design Problem with Secondary Hop Constraints. - Stefan Gollowitzer; Luis Eduardo Neves Gouveia; Ivana Ljubic (INOC, 2011)

A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem. - Ivana Ljubic; Peter Putz; Juan José Salazar González (INOC, 2011)

MIP models for connected facility location: A theoretical and computational study. - Stefan Gollowitzer; Ivana Ljubic (Comput. Oper. Res., 2011)

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. - Luis Eduardo Neves Gouveia; Markus Leitner; Ivana Ljubic (ISCO, 2012)

Variable Neighborhood Search for Solving the Balanced Location Problem. - Jozef Kratica; Markus Leitner; Ivana Ljubic (Electron. Notes Discret. Math., 2012)

Exact approaches to the single-source network loading problem. - Ivana Ljubic; Peter Putz; Juan José Salazar González (Networks, 2012)

The Rooted Maximum Node-Weight Connected Subgraph Problem. - Eduardo Álvarez-Miranda; Ivana Ljubic; Petra Mutzel (CPAIOR, 2013)

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (4OR, 2013)

A cutting plane algorithm for the Capacitated Connected Facility Location Problem. - Stefan Gollowitzer; Bernard Gendron; Ivana Ljubic (Comput. Optim. Appl., 2013)

Lagrangian decompositions for the two-level FTTx network design problem. - Andreas Bley; Ivana Ljubic; Olaf Maurer (EURO J. Comput. Optim., 2013)

Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method. - Markus Leitner; Ivana Ljubic; Markus Sinnl (Electron. Notes Discret. Math., 2013)

On the Two-Architecture Connected Facility Location Problem. - Markus Leitner; Ivana Ljubic; Markus Sinnl; Axel Werner (Electron. Notes Discret. Math., 2013)

Stochastic Survivable Network Design Problems. - Ivana Ljubic; Petra Mutzel; Bernd Zey (Electron. Notes Discret. Math., 2013)

Exact approaches for solving robust prize-collecting Steiner tree problems. - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (Eur. J. Oper. Res., 2013)

Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. - Stefan Gollowitzer; Luis Eduardo Neves Gouveia; Ivana Ljubic (Eur. J. Oper. Res., 2013)

Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem. - Ivana Ljubic; Stefan Gollowitzer (INFORMS J. Comput., 2013)

A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs. - Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Max Resch (Hybrid Metaheuristics, 2014)

On the Asymmetric Connected Facility Location Polytope. - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (ISCO, 2014)

Hop constrained Steiner trees with multiple root nodes. - Luis Eduardo Neves Gouveia; Markus Leitner; Ivana Ljubic (Eur. J. Oper. Res., 2014)

A MIP-based approach to solve the prize-collecting local access network design problem. - Ivana Ljubic; Peter Putz; Juan José Salazar González (Eur. J. Oper. Res., 2014)

ILP and CP Formulations for the Lazy Bureaucrat Problem. - Fabio Furini; Ivana Ljubic; Markus Sinnl (CPAIOR, 2015)

The Recoverable Robust Two-Level Network Design Problem. - Eduardo Álvarez-Miranda; Ivana Ljubic; S. Raghavan 001; Paolo Toth (INFORMS J. Comput., 2015)

The Generalized Regenerator Location Problem. - Si Chen; Ivana Ljubic; S. Raghavan 001 (INFORMS J. Comput., 2015)

A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem. - Markus Leitner; Ivana Ljubic; Markus Sinnl (INFORMS J. Comput., 2015)

The two-level diameter constrained spanning tree problem. - Luis Eduardo Neves Gouveia; Markus Leitner; Ivana Ljubic (Math. Program., 2015)

Intersection Cuts for Bilevel Optimization. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (IPCO, 2016)

ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design. - Markus Leitner; Ivana Ljubic; Markus Sinnl; Axel Werner (Comput. Oper. Res., 2016)

Benders decomposition without separability: A computational study for capacitated facility location problems. - Matteo Fischetti; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2016)

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints. - Markus Sinnl; Ivana Ljubic (Math. Program. Comput., 2016)

Solving minimum-cost shared arborescence problems. - Eduardo Álvarez-Miranda; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (Eur. J. Oper. Res., 2017)

Feature cluster: Recent advances in exact methods for multi-objective optimisation. - Matthias Ehrgott; Ivana Ljubic; Sophie N. Parragh (Eur. J. Oper. Res., 2017)

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. - Fabio Furini; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2017)

An algorithmic framework for the exact solution of tree-star problems. - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (Eur. J. Oper. Res., 2017)

Stochastic survivable network design problems: Theory and practice. - Ivana Ljubic; Petra Mutzel; Bernd Zey (Eur. J. Oper. Res., 2017)

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (Oper. Res., 2017)

Redesigning Benders Decomposition for Large-Scale Facility Location. - Matteo Fischetti; Ivana Ljubic; Markus Sinnl (Manag. Sci., 2017)

Thinning out Steiner trees: a node-based model for uniform edge costs. - Matteo Fischetti; Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Michele Monaci; Max Resch; Domenico Salvagnin; Markus Sinnl (Math. Program. Comput., 2017)

A node-based ILP formulation for the node-weighted dominating Steiner problem. - Andreas Bley; Ivana Ljubic; Olaf Maurer (Networks, 2017)

Decomposition methods for the two-stage stochastic Steiner tree problem. - Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (Comput. Optim. Appl., 2018)

The connected facility location polytope. - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (Discret. Appl. Math., 2018)

Outer approximation and submodular cuts for maximum capture facility location problems with random utilities. - Ivana Ljubic; Eduardo Moreno 001 (Eur. J. Oper. Res., 2018)

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. - Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (INFORMS J. Comput., 2018)

On the use of intersection cuts for bilevel optimization. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (Math. Program., 2018)

The incremental connected facility location problem. - Ashwin Arulselvan; Andreas Bley; Ivana Ljubic (Comput. Oper. Res., 2019)

Benders decomposition for very large scale partial set covering and maximal covering location problems. - Jean-François Cordeau; Fabio Furini; Ivana Ljubic (Eur. J. Oper. Res., 2019)

The maximum clique interdiction problem. - Fabio Furini; Ivana Ljubic; Sébastien Martin; Pablo San Segundo (Eur. J. Oper. Res., 2019)

A new branch-and-bound algorithm for the maximum edge-weighted clique problem. - Pablo San Segundo; Stefano Coniglio; Fabio Furini; Ivana Ljubic (Eur. J. Oper. Res., 2019)

Interdiction Games and Monotonicity, with Application to Knapsack Problems. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (INFORMS J. Comput., 2019)

Exact Approaches for Network Design Problems with Relays. - Markus Leitner; Ivana Ljubic; Martin Riedler; Mario Ruthmair (INFORMS J. Comput., 2019)

Virtual Network Functions Placement and Routing Problem: Path formulation. - Ahlam Mouaci; Éric Gourdin; Ivana Ljubic; Nancy Perrot (Networking, 2020)

Preface: decomposition methods for hard optimization problems. - Fabio Furini; Ivana Ljubic; Emiliano Traversi (Ann. Oper. Res., 2020)

A polyhedral study of the diameter constrained minimum spanning tree problem. - Luis Gouveia 001; Markus Leitner; Ivana Ljubic (Discret. Appl. Math., 2020)

On integer and bilevel formulations for the k-vertex cut problem. - Fabio Furini; Ivana Ljubic; Enrico Malaguti; Paolo Paronuzzi (Math. Program. Comput., 2020)

Location of Charging Stations in Electric Car Sharing Systems. - Georg Brandstätter; Markus Leitner; Ivana Ljubic (Transp. Sci., 2020)

Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem. - Ivana Ljubic; Ahlam Mouaci; Nancy Perrot; Éric Gourdin (Comput. Oper. Res., 2021)

An Exact Method for Fortification Games. - Markus Leitner; Ivana Ljubic; Michele Monaci; Markus Sinnl; Kübra Taninmis (CoRR, 2021)

A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. - Thomas Kleinert; Martine Labbé; Ivana Ljubic; Martin Schmidt 003 (EURO J. Comput. Optim., 2021)

An exact method for assortment optimization under the nested logit model. - Laurent Alfandari; Alborz Hassanzadeh; Ivana Ljubic (Eur. J. Oper. Res., 2021)

The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. - Eduardo Álvarez-Miranda; Marcos Goycoolea; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2021)

A branch-and-cut algorithm for the Edge Interdiction Clique Problem. - Fabio Furini; Ivana Ljubic; Pablo San Segundo; Yanlu Zhao (Eur. J. Oper. Res., 2021)

Solving Steiner trees: Recent advances, challenges, and perspectives. - Ivana Ljubic (Networks, 2021)

A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots. - Ivana Ljubic (ICORES, 2022)

SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. - Elisabeth Gaar; Jon Lee 001; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (IPCO, 2022)

A tailored Benders decomposition approach for last-mile delivery with autonomous robots. - Laurent Alfandari; Ivana Ljubic; Marcos de Melo da Silva (Eur. J. Oper. Res., 2022)

Comparison of formulations for the Inventory Routing Problem. - Claudia Archetti; Ivana Ljubic (Eur. J. Oper. Res., 2022)

Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. - Fabio Furini; Ivana Ljubic; Enrico Malaguti; Paolo Paronuzzi (Oper. Res., 2022)

Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. - Stefano Coniglio; Fabio Furini; Ivana Ljubic (Math. Program., 2022)

Budgeting in International Humanitarian Organizations. - Milad Keshvari Fard; Ivana Ljubic; Felix Papier (Manuf. Serv. Oper. Manag., 2022)

Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption. - Elena Fernández 001; Markus Leitner; Ivana Ljubic; Mario Ruthmair (Transp. Sci., 2022)

An exact method for binary fortification games. - Markus Leitner; Ivana Ljubic; Michele Monaci; Markus Sinnl; Kübra Taninmis (Eur. J. Oper. Res., 2023)

Two extended formulations for the virtual network function placement and routing problem. - Ahlam Mouaci; Éric Gourdin; Ivana Ljubic; Nancy Perrot (Networks, 2023)

Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs. - Cristian Ramirez-Pico; Ivana Ljubic; Eduardo Moreno 001 (Transp. Sci., 2023)

Mathematical programming formulations for the Collapsed k-Core Problem. - Martina Cerulli; Domenico Serra; Carmine Sorgente; Claudia Archetti; Ivana Ljubic (Eur. J. Oper. Res., 2023)

A survey on bilevel optimization under uncertainty. - Yasmine Beck; Ivana Ljubic; Martin Schmidt 003 (Eur. J. Oper. Res., 2023)

Exact methods for discrete ${ varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem. - Yasmine Beck; Ivana Ljubic; Martin Schmidt 003 (Math. Program. Comput., 2023)

Benders decomposition for congested partial set covering location with uncertain demand. - Alice Calamita; Ivana Ljubic; Laura Palagi (CoRR, 2024)

Benders decomposition for the discrete ordered median problem. - Ivana Ljubic; Miguel A. Pozo 001; Justo Puerto; Alberto Torrejón (Eur. J. Oper. Res., 2024)

The Impact of Passive Social Media Viewers in Influence Maximization. - Michael Kahr; Markus Leitner; Ivana Ljubic (INFORMS J. Comput., 2024)

Three network design problems for community energy storage. - Bissan Ghaddar; Ivana Ljubic; Yuying Qiu (Networks, 2024)

A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery. - Martina Cerulli; Claudia Archetti; Elena Fernández 001; Ivana Ljubic (Transp. Sci., 2024)

Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates. - Yuanyuan Li; Claudia Archetti; Ivana Ljubic (Transp. Sci., 2024)

Operational Research: methods and applications. - 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; et al. (J. Oper. Res. Soc., 2024)

New formulations for two location problems with interconnected facilities. - Yerlan Kuzbakov; Ivana Ljubic (Eur. J. Oper. Res., 2024)

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. - Elisabeth Gaar; Jon Lee 001; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (Math. Program., 2024)

Emerging optimization problems for distribution in same-day delivery. - Yuanyuan Li; Claudia Archetti; Ivana Ljubic (Comput. Oper. Res., 2025)

Last fifty years of integer linear programming: A focus on recent practical advances. - François Clautiaux; Ivana Ljubic (Eur. J. Oper. Res., 2025)