Ivana Ljubic

118 papers A 3B 5C 9Journal 90Unranked 10
YearRankTypeTitle / Venue / Authors
2026 J jnl
Benders decomposition for congested partial set covering location with uncertain demand.
Eur. J. Oper. Res.
Alice Calamita, Ivana Ljubic, Laura Palagi
2026 J jnl
Bilevel optimization with sustainability perspective: A survey on applications.
Eur. J. Oper. Res.
Giulia Caselli, Manuel Iori, Ivana Ljubic
2026 J jnl
Heuristic Methods for Γ-Robust Mixed-Integer Linear Bilevel Problems.
INFORMS J. Comput.
Yasmine Beck, Ivana Ljubic, Martin Schmidt
2025 J jnl
Emerging optimization problems for distribution in same-day delivery.
Comput. Oper. Res.
YuanYuan Li, Claudia Archetti, Ivana Ljubic
2025 J jnl
Last fifty years of integer linear programming: A focus on recent practical advances.
Eur. J. Oper. Res.
François Clautiaux, Ivana Ljubic
2024 J jnl
A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery.
Transp. Sci.
Martina Cerulli, Claudia Archetti, Elena Fernández, Ivana Ljubic
2024 J jnl
Benders decomposition for congested partial set covering location with uncertain demand.
CoRR
Alice Calamita, Ivana Ljubic, Laura Palagi
2024 J jnl
Benders decomposition for the discrete ordered median problem.
Eur. J. Oper. Res.
Ivana Ljubic, Miguel A. Pozo, Justo Puerto, Alberto Torrejón
2024 J jnl
New formulations for two location problems with interconnected facilities.
Eur. J. Oper. Res.
Yerlan Kuzbakov, Ivana Ljubic
2024 J jnl
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.
Math. Program.
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2024 J jnl
Operational Research: methods and applications.
J. Oper. Res. Soc.
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
2024 J jnl
Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates.
Transp. Sci.
YuanYuan Li, Claudia Archetti, Ivana Ljubic
2024 J jnl
The Impact of Passive Social Media Viewers in Influence Maximization.
INFORMS J. Comput.
Michael Kahr, Markus Leitner, Ivana Ljubic
2024 J jnl
Three network design problems for community energy storage.
Networks
Bissan Ghaddar, Ivana Ljubic, Yuying Qiu
2023 J jnl
A survey on bilevel optimization under uncertainty.
Eur. J. Oper. Res.
Yasmine Beck, Ivana Ljubic, Martin Schmidt
2023 J jnl
An exact method for binary fortification games.
Eur. J. Oper. Res.
Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
2023 J jnl
Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs.
Transp. Sci.
Cristian Ramirez-Pico, Ivana Ljubic, Eduardo Moreno
2023 J jnl
Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem.
Math. Program. Comput.
Yasmine Beck, Ivana Ljubic, Martin Schmidt
2023 J jnl
Mathematical programming formulations for the Collapsed k-Core Problem.
Eur. J. Oper. Res.
Martina Cerulli, Domenico Serra, Carmine Sorgente, Claudia Archetti, Ivana Ljubic
2023 J jnl
Two extended formulations for the virtual network function placement and routing problem.
Networks
Ahlam Mouaci, Éric Gourdin, Ivana Ljubic, Nancy Perrot
2022 C conf
A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots.
ICORES
Ivana Ljubic
2022 J jnl
A tailored Benders decomposition approach for last-mile delivery with autonomous robots.
Eur. J. Oper. Res.
Laurent Alfandari, Ivana Ljubic, Marcos de Melo da Silva
2022 J jnl
Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption.
Transp. Sci.
Elena Fernández, Markus Leitner, Ivana Ljubic, Mario Ruthmair
2022 J jnl
Budgeting in International Humanitarian Organizations.
Manuf. Serv. Oper. Manag.
Milad Keshvari Fard, Ivana Ljubic, Felix Papier
2022 J jnl
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem.
Oper. Res.
Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi
2022 C ed.
Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers
ISCO
Ivana Ljubic, Francisco Barahona, Santanu S. Dey, Ali Ridha Mahjoub
2022 J jnl
Comparison of formulations for the Inventory Routing Problem.
Eur. J. Oper. Res.
Claudia Archetti, Ivana Ljubic
2022 J jnl
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.
CoRR
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2022 J jnl
Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates.
CoRR
YuanYuan Li, Claudia Archetti, Ivana Ljubic
2022 B conf
SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs.
IPCO
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2022 J jnl
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems.
Math. Program.
Stefano Coniglio, Fabio Furini, Ivana Ljubic
2021 J jnl
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization.
EURO J. Comput. Optim.
Thomas Kleinert, Martine Labbé, Ivana Ljubic, Martin Schmidt
2021 J jnl
A branch-and-cut algorithm for the Edge Interdiction Clique Problem.
Eur. J. Oper. Res.
Fabio Furini, Ivana Ljubic, Pablo San Segundo, Yanlu Zhao
2021 J jnl
An Exact Method for Fortification Games.
CoRR
Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
2021 J jnl
An exact method for assortment optimization under the nested logit model.
Eur. J. Oper. Res.
Laurent Alfandari, Alborz Hassanzadeh, Ivana Ljubic
2021 J jnl
Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem.
Comput. Oper. Res.
Ivana Ljubic, Ahlam Mouaci, Nancy Perrot, Éric Gourdin
2021 J jnl
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs.
CoRR
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2021 J jnl
Solving Steiner trees: Recent advances, challenges, and perspectives.
Networks
Ivana Ljubic
2021 J jnl
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements.
Eur. J. Oper. Res.
Eduardo Álvarez-Miranda, Marcos Goycoolea, Ivana Ljubic, Markus Sinnl
2020 J jnl
A polyhedral study of the diameter constrained minimum spanning tree problem.
Discret. Appl. Math.
Luis Gouveia, Markus Leitner, Ivana Ljubic
2020 J jnl
Location of Charging Stations in Electric Car Sharing Systems.
Transp. Sci.
Georg Brandstätter, Markus Leitner, Ivana Ljubic
2020 J jnl
On integer and bilevel formulations for the
Math. Program. Comput.
Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi
2020 J jnl
Preface: decomposition methods for hard optimization problems.
Ann. Oper. Res.
Fabio Furini, Ivana Ljubic, Emiliano Traversi
2020 B conf
Virtual Network Functions Placement and Routing Problem: Path formulation.
Networking
Ahlam Mouaci, Éric Gourdin, Ivana Ljubic, Nancy Perrot
2019 J jnl
A new branch-and-bound algorithm for the maximum edge-weighted clique problem.
Eur. J. Oper. Res.
Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic
2019 J jnl
Benders decomposition for very large scale partial set covering and maximal covering location problems.
Eur. J. Oper. Res.
Jean-François Cordeau, Fabio Furini, Ivana Ljubic
2019 J jnl
Exact Approaches for Network Design Problems with Relays.
INFORMS J. Comput.
Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair
2019 J jnl
Interdiction Games and Monotonicity, with Application to Knapsack Problems.
INFORMS J. Comput.
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2019 J jnl
The incremental connected facility location problem.
Comput. Oper. Res.
Ashwin Arulselvan, Andreas Bley, Ivana Ljubic
2019 J jnl
The maximum clique interdiction problem.
Eur. J. Oper. Res.
Fabio Furini, Ivana Ljubic, Sébastien Martin, Pablo San Segundo
2018 J jnl
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems.
INFORMS J. Comput.
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
2018 J jnl
Decomposition methods for the two-stage stochastic Steiner tree problem.
Comput. Optim. Appl.
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
2018 J jnl
On the use of intersection cuts for bilevel optimization.
Math. Program.
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2018 J jnl
Outer approximation and submodular cuts for maximum capture facility location problems with random utilities.
Eur. J. Oper. Res.
Ivana Ljubic, Eduardo Moreno
2018 J jnl
The connected facility location polytope.
Discret. Appl. Math.
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
2017 J jnl
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs.
Oper. Res.
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2017 J jnl
A node-based ILP formulation for the node-weighted dominating Steiner problem.
Networks
Andreas Bley, Ivana Ljubic, Olaf Maurer
2017 J jnl
An algorithmic framework for the exact solution of tree-star problems.
Eur. J. Oper. Res.
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
2017 J jnl
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem.
Eur. J. Oper. Res.
Fabio Furini, Ivana Ljubic, Markus Sinnl
2017 J jnl
Feature cluster: Recent advances in exact methods for multi-objective optimisation.
Eur. J. Oper. Res.
Matthias Ehrgott, Ivana Ljubic, Sophie N. Parragh
2017 — ed.
Operations Research Proceedings 2015, Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1-4, 2015.
OR
Karl F. Doerner, Ivana Ljubic, Georg Pflug, Gernot Tragler
2017 J jnl
Redesigning Benders Decomposition for Large-Scale Facility Location.
Manag. Sci.
Matteo Fischetti, Ivana Ljubic, Markus Sinnl
2017 J jnl
Solving minimum-cost shared arborescence problems.
Eur. J. Oper. Res.
Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
2017 J jnl
Stochastic survivable network design problems: Theory and practice.
Eur. J. Oper. Res.
Ivana Ljubic, Petra Mutzel, Bernd Zey
2017 J jnl
Thinning out Steiner trees: a node-based model for uniform edge costs.
Math. Program. Comput.
Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl
2016 J jnl
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints.
Math. Program. Comput.
Markus Sinnl, Ivana Ljubic
2016 J jnl
Benders decomposition without separability: A computational study for capacitated facility location problems.
Eur. J. Oper. Res.
Matteo Fischetti, Ivana Ljubic, Markus Sinnl
2016 J jnl
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design.
Comput. Oper. Res.
Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner
2016 B conf
Intersection Cuts for Bilevel Optimization.
IPCO
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2015 J jnl
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem.
INFORMS J. Comput.
Markus Leitner, Ivana Ljubic, Markus Sinnl
2015 B conf
ILP and CP Formulations for the Lazy Bureaucrat Problem.
CPAIOR
Fabio Furini, Ivana Ljubic, Markus Sinnl
2015 J jnl
The Generalized Regenerator Location Problem.
INFORMS J. Comput.
Si Chen, Ivana Ljubic, S. Raghavan
2015 J jnl
The Recoverable Robust Two-Level Network Design Problem.
INFORMS J. Comput.
Eduardo Álvarez-Miranda, Ivana Ljubic, S. Raghavan, Paolo Toth
2015 J jnl
The two-level diameter constrained spanning tree problem.
Math. Program.
Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
2014 J jnl
A MIP-based approach to solve the prize-collecting local access network design problem.
Eur. J. Oper. Res.
Ivana Ljubic, Peter Putz, Juan José Salazar González
2014 — conf
A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs.
Hybrid Metaheuristics
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Max Resch
2014 J jnl
Hop constrained Steiner trees with multiple root nodes.
Eur. J. Oper. Res.
Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
2014 C conf
On the Asymmetric Connected Facility Location Polytope.
ISCO
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
2013 J jnl
A cutting plane algorithm for the Capacitated Connected Facility Location Problem.
Comput. Optim. Appl.
Stefan Gollowitzer, Bernard Gendron, Ivana Ljubic
2013 J jnl
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems.
4OR
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
2013 J jnl
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities.
Eur. J. Oper. Res.
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic
2013 J jnl
Exact approaches for solving robust prize-collecting Steiner tree problems.
Eur. J. Oper. Res.
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
2013 J jnl
Lagrangian decompositions for the two-level FTTx network design problem.
EURO J. Comput. Optim.
Andreas Bley, Ivana Ljubic, Olaf Maurer
2013 J jnl
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem.
INFORMS J. Comput.
Ivana Ljubic, Stefan Gollowitzer
2013 J jnl
On the Two-Architecture Connected Facility Location Problem.
Electron. Notes Discret. Math.
Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner
2013 J jnl
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method.
Electron. Notes Discret. Math.
Markus Leitner, Ivana Ljubic, Markus Sinnl
2013 J jnl
Stochastic Survivable Network Design Problems.
Electron. Notes Discret. Math.
Ivana Ljubic, Petra Mutzel, Bernd Zey
2013 B conf
The Rooted Maximum Node-Weight Connected Subgraph Problem.
CPAIOR
Eduardo Álvarez-Miranda, Ivana Ljubic, Petra Mutzel
2012 J jnl
Exact approaches to the single-source network loading problem.
Networks
Ivana Ljubic, Peter Putz, Juan José Salazar González
2012 C conf
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes.
ISCO
Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
2012 J jnl
Variable Neighborhood Search for Solving the Balanced Location Problem.
Electron. Notes Discret. Math.
Jozef Kratica, Markus Leitner, Ivana Ljubic
2011 C conf
A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem.
INOC
Ivana Ljubic, Peter Putz, Juan José Salazar González
2011 C conf
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes.
INOC
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic
2011 — conf
Exact solutions for the robust prize-collecting steiner tree problem.
ICUMT
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
2011 C conf
MIP Modeling of Incremental Connected Facility Location.
INOC
Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer
2011 J jnl
MIP models for connected facility location: A theoretical and computational study.
Comput. Oper. Res.
Stefan Gollowitzer, Ivana Ljubic
2011 C conf
The Two Level Network Design Problem with Secondary Hop Constraints.
INOC
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic
2010 J jnl
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation.
Networks
Ivana Ljubic
2010 J jnl
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs.
Electron. Notes Discret. Math.
Ivana Ljubic, Stefan Gollowitzer
2010 J jnl
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice.
Math. Program.
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel
2010 — conf
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.
ISAAC (1)
Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey
2010 J jnl
The regenerator location problem.
Networks
Si Chen, Ivana Ljubic, S. Raghavan
2009 J jnl
Obtaining optimal
ACM J. Exp. Algorithmics
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel
2008 — conf
A GRASP Algorithm for the Connected Facility Location Problem.
SAINT
Alessandro Tomazic, Ivana Ljubic
2008 A conf
Obtaining Optimal k-Cardinality Trees Fast.
ALENEX
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel
2008 C conf
Strong Formulations for 2-Node-Connected Steiner Network Problems.
COCOA
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel
2007 — conf
A Hybrid VNS for Connected Facility Location.
Hybrid Metaheuristics
Ivana Ljubic
2006 J jnl
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.
Math. Program.
Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
2005 — conf
Solving the Prize-Collecting Steiner Tree Problem to Optimality.
ALENEX/ANALCO
Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
2004 — conf
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.
GECCO (1)
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher
2003 — conf
A Genetic Algorithm for the Index Selection Problem.
EvoWorkshops
Jozef Kratica, Ivana Ljubic, Dusan Tosic
2003 J jnl
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs.
J. Heuristics
Ivana Ljubic, Günther R. Raidl
2003 A conf
The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.
ESA
Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher
2002 — conf
A Memetic Algorithm for Vertex-Biconnectivity Augmentation.
EvoWorkshops
Sandor Kersting, Günther R. Raidl, Ivana Ljubic
2002 J jnl
Evolutionary local search for the edge-biconnectivity augmentation problem.
Inf. Process. Lett.
Günther R. Raidl, Ivana Ljubic
2001 — conf
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem.
EvoWorkshops
Ivana Ljubic, Günther R. Raidl
2001 J jnl
Solving the simple plant location problem by genetic algorithm.
RAIRO Oper. Res.
Jozef Kratica, Dusan Tosic, Vladimir Filipovic, Ivana Ljubic
2000 A conf
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem.
PPSN
Ivana Ljubic, Günther R. Raidl, Jozef Kratica