Sitemap
A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.
Pages
Posts
Future Blog Post
Published:
Blog Post number 4
Published:
Blog Post number 3
Published:
Blog Post number 2
Published:
Blog Post number 1
Published:
portfolio
publications
A genetic algorithm for the biconnectivity augmentation problem
I. Ljubić and J. Kratica, IEEE Congress on Evolutionary Computation, IEEE Press, pp. 89-96, (2000)A Hybrid GA for the Edge-Biconnectivity Augmentation Problem
I. Ljubić, G. R. Raidl, and J. Kratica, PPSN, Volume 1917 of Springer Lecture Notes in Computer Science, pp. 641-650, (2000)An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
I. Ljubić, and G. R. Raidl, EvoWorkshops, Volume 2037 of Springer Lecture Notes in Computer Science, pp. 20-29, (2001)Solving the simple plant location problem by genetic algorithm
Jozef Kratica, Dusan Tosic, Vladimir Filipovic, Ivana Ljubić, RAIRO Oper. Res. 35(1): 127-142, (2001)A Memetic Algorithm for Vertex-Biconnectivity Augmentation
S. Kersting, G. R. Raidl, and I. Ljubić, EvoWorkshops, Volume 2279 of Springer Lecture Notes in Computer Science, pp. 102-111, (2002)Evolutionary local search for the edge-biconnectivity augmentation problem
Günther R. Raidl, Ivana Ljubić, Inf. Process. Lett. 82(1): 39-45, (2002)A genetic algorithm for the index selection problem
J. Kratica, I. Ljubić, and D. Tosic, EvoWorkshops, Volume 2611 of Springer Lecture Notes in Computer Science, pp. 280-290, (2003)A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs
Ivana Ljubić, Günther R. Raidl, J. Heuristics 9(5): 401-427, (2003)The Fractional Prize-Collecting Steiner Tree Problem on Trees
G.W. Klau, I. Ljubić, P. Mutzel, U. Pferschy, R. Weiskircher, ESA, Volume 2832 of Springer Lecture Notes in Computer Science, pp. 691-702, (2003)Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem
G.W. Klau, I. Ljubić, A. Moser, P. Mutzel, P. Neuner, U. Pferschy G. Raidl, R. Weiskircher, GECCO, Volume 3102 of Springer Lecture Notes in Computer Science, pp. 1304-1315, (2004)Exact and Memetic Algorithms for Two Network Design Problems
Ivana Ljubić, Faculty of Computer Science, Vienna University of Technology, (2004)Solving the prize-collecting Steiner tree problem to optimality
I. Ljubić, R. Weiskircher, U. Pferschy, G. Klau, P. Mutzel, and M. Fischetti, ALENEX, SIAM, pp. 68-76, 2005. ISBN 0-89871-596-2, (2005)An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem
I. Ljubić, R. Weiskircher, U. Pferschy, G. Klau, P. Mutzel, and M.Fischetti, Math. Program. 105(2-3): 427-449, (2006)A Hybrid VNS for Connected Facility Location
I. Ljubić, Hybrid Metaheuristics 2007, Volume 4771 of Springer Lecture Notes in Computer Science, pp. 157-169, (2007)A GRASP Algorithm for Connected Facility Location
A. Tomazic, I. Ljubić, International Symposium on Applications and the Internet, IEEE CS Press, pp. 257-260, (2008)Obtaining Optimal k-Cardinality Trees Fast
M. Chimani, M. Kandyba, I. Ljubić, and P. Mutzel, ALENEX, SIAM, pp. 27-36, (2008)Strong Formulations for 2-Node-Connected Steiner Network Problems
M. Chimani, M. Kandyba, I. Ljubić, and P. Mutzel, COCOA, Volume 5165 of Lecture Notes in Computer Science, pp. 190-200, (2008)Exact Approaches to the Single-Source Network Loading Problem
I. Ljubić. P. Putz, J.J. Salazar, INOC, (2009)Obtaining optimal k-cardinality trees fast
M. Chimani, M. Kandyba, I. Ljubić, and P. Mutzel, ACM J. Exp. Algorithmics 14, (2009)The Generalized Regenerator Location Problem
S. Chen, I. Ljubić, S. Raghavan, INOC, (2009)A Branch-and-Cut-and-Price Algorithm for Vertex Biconnectivity Augmentation
I. Ljubić, Networks 56(3): 169-182, (2010)Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
I. Ljubić, S. Gollowitzer, ISCO, Electronic Notes in Discrete Mathematics 36, 207-214, (2010)Orientation-based Models for {0,1,2}-Survivable Network Design: Theory and Practice
M. Chimani, M. Kandyba, I. Ljubić, and P. Mutzel, Math. Program. 124(1-2): 413-439, (2010)Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubić, Petra Mutzel, Bernd Zey, ISAAC, Volume 6506 of Lecture Notes in Computer Science, pp. 427-439, (2010)The regenerator location problem
S. Chen, I. Ljubić, and S. Raghavan, Networks 55(3): 205-220, (2010)A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
S. Gollowitzer, L. Gouveia and I. Ljubić, INOC, Volume 6701 of Lecture Notes in Computer Science, pp. 57-70, (2011)Exact Solutions for the Robust Prize-Collecting Steiner Tree Problem
E. Alvarez-Miranda, I. Ljubić, P. Toth, RNDM, IEEE Xplore, ISSN: 2157-0221, pp. 1-7, (2011)MIP modeling of Incremental Connected Facility Location
A. Arulselvan, A. Bley, S. Gollowitzer, I. Ljubić, O. Maurer, INOC, Volume 6701 of Lecture Notes in Computer Science, pp. 490-502, (2011)MIP Models for Connected Facility Location: A Theoretical and Computational Study
S. Gollowitzer, I. Ljubić, Comput. Oper. Res. 38(2): 435-449 , (2011)Exact Approaches to the Single-Source Network Loading Problem
I. Ljubić. P. Putz, and J.J. Salazar-Gonzalez, Networks 59(1): 89-106, (2012)On the Hop Constrained Steiner Tree Problem with multiple Root Nodes
L. Gouveia, M. Leitner, I. Ljubić, ISCO, Volume 7422 of Lecture Notes in Computer Science, pp. 201-212, (2012)QTL Mapping Using a Memetic Algorithm with Modifications of BIC as Fitness Function
F. Frommlet, I. Ljubić, H.B. Arnardóttir, M. Bogdan, Stat. App. Gene. Mol. Bio, (2012)Variable Neighborhood Search for Solving the Balanced Location Problem
J. Kratica, M. Leitner, I. Ljubić, EUROmC XXVIII VNS, Volume 39 of Electronic Notes in Discrete Mathematics, pp. 21-28, (2012)A cutting plane algorithm for the capacitated connected facility location problem
S. Gollowitzer, B. Gendron, I. Ljubić, Comput. Optim. Appl. 55(3): 647-674, (2013)A Note on the Bertsimas and Sim Algorithm for Robust Combinatorial Optimization Problems
E. Alvarez-Miranda, I. Ljubić, P. Toth, 4OR 11(4): 349-360, (2013)Enhanced Formulations and Branch-and-Cut for the Two Level Network Design Problem with Transition Facilities
S. Gollowitzer, L. Gouveia, I. Ljubić, Eur. J. Oper. Res. 225(2): 211-222, (2013)Exact Approaches for Solving Robust Prize-Collecting Steiner Tree Problems
E. Alvarez-Miranda, I. Ljubić, P. Toth, Eur. J. Oper. Res. 229(3): 599-612, (2013)Lagrangian Decompositions for the Two-Level FTTx Network Design Problem
A. Bley, I. Ljubić, O. Maurer, EURO J. Comput. Optim. 1(3-4): 221-252, (2013)Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem
I. Ljubić, S. Gollowitzer, INFORMS J. Comput. 25(2): 256-270, (2013)On the two-architecture connected facility location problem
M. Leitner, I. Ljubić, M. Sinnl, and A. Werner, INOC, volume 41 of Electronic Notes in Discrete Mathematics, pp. 359-366, (2013)Solving the bi-objective prize-collecting Steiner tree problem with the e-constraint method
M. Leitner, I. Ljubić, and M. Sinnl, INOC, Volume 41 of Electronic Notes in Discrete Mathematics, pp. 181-188, (2013)Stochastic Survivable Network Design Problems
I. Ljubić, P. Mutzel, B. Zey, INOC 2013, Volume 41 of Electronic Notes in Discrete Mathematics, pp. 245-252, (2013)The Maximum Weight Connected Subgraph Problem
E. Alvarez-Miranda, I. Ljubić, P. Mutzel, M. Jünger and G. Reinelt, Facets of Combinatorial Optimization, pp. 245-270, Springer, (2013)The Rooted Maximum Node-Weight Connected Subgraph Problem
E. Alvarez-Miranda, I. Ljubić, P. Mutzel, CPAIOR, Volume 7874 of Lecture Notes in Computer Science, pp. 300-315, (2013)A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem
I. Ljubić. P. Putz, and J.J. Salazar-Gonzalez, Eur. J. Oper. Res. 235(3): 727-739, (2014)A partition-based heuristic for the Steiner tree problem in large graphs
Markus Leitner, Ivana Ljubić, Martin Luipersbeck, Max Resch, HM 2014, Volume 8457 of Lecture Notes in Computer Science, pp. 56-70, (2014)Hop Constrained Steiner Trees with multiple Root Nodes
L. Gouveia, M. Leitner, I. Ljubić, Eur. J. Oper. Res. 236(1): 100-112, (2014)On the Asymmetric Connected Facility Location Polytope
M. Leitner, I. Ljubić, J.J. Salazar-Gonzalez, M. Sinnl, ISCO 2014, Volume 8596 Lecture Notes in Computer Science, pp. 371-383, (2014)A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
M. Leitner, I. Ljubić, M. Sinnl, INFORMS J. Comput. 27(1): 118-134, (2015)ILP and CP Formulations for the Lazy Bureaucrat Problem
F. Furini, I. Ljubić, M. Sinnl, CPAIOR 2015, Volume 9075 of Lecture Notes in Computer Science, pp. 255-270, (2015)The Generalized Regenerator Location Problem
S. Chen, I. Ljubić, S. Raghavan, INFORMS J. Comput. 27(2): 204-220, (2015)The Recoverable Robust Two-Level Network Design Problem
E. Alvarez-Miranda, I. Ljubić, S. Raghavan, P. Toth, INFORMS J. Comput. 27(1): 1-19, (2015)The Two-Level Diameter Constrained Spanning Tree Problem
L. Gouveia, M. Leitner, I. Ljubić, Math. Program. 150(1): 49-78, (2015)A Node-Based Layered Graph Approach for the Steiner Tree Problem with Revenues, Budget and Hop-Constraints
M. Sinnl, I. Ljubić, Math. Program. Comput. 8(4): 461-490, (2016)Benders decomposition without separability: A computational study for capacitated facility location problems
M. Fischetti, I. Ljubić, M. Sinnl, Eur. J. Oper. Res. 253(3): 557-569, (2016)ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design
M. Leitner, I. Ljubić, M. Sinnl, A. Werner, Comput. Oper. Res. 72: 128-146, (2016)Intersection Cuts for Bilevel Optimization
M. Fischetti, I. Ljubić, M. Monaci, M. Sinnl, IPCO 2016, Springer, Volume 9682 of Lecture Notes in Computer Science, pp 77-88, (2016)A new general-purpose algorithm for mixed-integer bilevel linear programs
M. Fischetti, I. Ljubić, M. Monaci, M. Sinnl, Oper. Res. 65(6): 1615-1637, (2017)A Node-Based ILP Formulation for the Node-Weighted Dominating Steiner Problem
A. Bley, I. Ljubić, O. Maurer, Networks 69(1): 33-51, (2017)An Algorithmic Framework for the Exact Solution of Tree-Star Problems
M. Leitner, I. Ljubić, J.J. Salazar-Gonzalez, and M. Sinnl, Eur. J. Oper. Res. 261(1): 54-66, (2017)An Effective Dynamic Programming Algorithm for the Minimum-Cost Maximal Knapsack Packing Problem
F. Furini, I. Ljubić and M. Sinnl, Eur. J. Oper. Res. 262(2): 438-448, (2017)Feature Cluster: Recent Advances in Exact Methods for Multi-Objective Optimisation
M. Ehrgott, I. Ljubić, and S.N. Parragh, Eur. J. Oper. Res. 260(3): 805-806, (2017)Operations Research Proceedings 2015
Editors: Doerner, K., Ljubić, I., Pflug, G., Tragler, G., Springer, (2017)Redesigning Benders Decomposition for Large Scale Facility Location
M. Fischetti, I. Ljubić, M. Sinnl, Manag. Sci. 63(7): 2146-2162, (2017)Solving Minimum-Cost Shared Arborescence Problems
E. Alvarez-Miranda, I. Ljubić, M. Luipersbeck, M. Sinnl, Eur. J. Oper. Res. 258(3): 887-901, (2017)Stochastic Survivable Network Design Problems: Theory and Practice
I. Ljubić, P. Mutzel, B. Zey, Eur. J. Oper. Res. 256(2): 333-348, (2017)Thinning out Steiner trees: A node based model for uniform edge costs
M. Fischetti, M. Leitner, I. Ljubić, M. Luipersbeck, M. Monaci, M. Resch, D, Salvagnin, M. Sinnl, Math. Program. Comput. 9(2): 203-229, (2017)A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
M. Leitner, I. Ljubić, M. Luipersbeck, M. Sinnl, INFORMS J. Comput. 30(2): 402-420, (2018)Decomposition methods for the two-stage stochastic Steiner tree problem
M. Leitner, I. Ljubić, M. Luipersbeck, M. Sinnl, Comput. Optim. Appl. 69(3): 713-752, (2018)On the Use of Intersection Cuts for Bilevel Optimization
M. Fischetti, I. Ljubić, M. Monaci, M. Sinnl, Math. Program. 172(1-2): 77-103, (2018)Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
I. Ljubić, E. Moreno, Eur. J. Oper. Res. 266(1): 46-56, (2018)The Connected Facility Location Polytope
M. Leitner, I. Ljubić, J.J. Salazar-Gonzalez, M. Sinnl, Discret. Appl. Math. 234: 151-167, (2018)A new branch-and-bound algorithm for the maximum edge-weighted clique problem
P. San Segundo, S Coniglio, F. Furini, I. Ljubić, Eur. J. Oper. Res. 278(1): 76-90, (2019)Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Problems
J.F. Cordeau, F. Furini, I. Ljubić, Eur. J. Oper. Res. 275(3): 882-896, (2019)Exact Approaches for Network Design Problems with Relays
M. Leitner, I. Ljubić, M. Riedler, M. Ruthmair, INFORMS J. Comput. 31(1): 171-192, (2019)Exact approaches for the directed network design problem with relays
M. Leitner, I. Ljubić, M. Riedler, M. Ruthmair, Omega (91): 102005, (2019)Interdiction Games and Monotonicity, with Application to Knapsack Problems
M. Fischetti, I. Ljubić, M. Monaci, M. Sinnl, INFORMS J. Comput. 31(2): 390-410, (2019)The Incremental Connected Facility Location Problem
A. Arulselvan, A. Bley, I. Ljubić, Comput. Oper. Res. 112, (2019)The Maximum Clique Interdiction Problem
F. Furini, I. Ljubić, S. Martin, P. San Segundo, Eur. J. Oper. Res. 277(1): 112-127, (2019)Tighter MIP formulations for Barge Container Ship Routing
L. Alfandari, T. Davidovic, F. Furini, I. Ljubić, V. Maras, S. Martin, Omega 82: 38-54, (2019)A polyhedral study of the diameter constrained minimum spanning tree problem
L. Gouveia, M. Leitner, I. Ljubić, Discret. Appl. Math. 285: 364-379, (2020)Location of Charging Stations in Electric Car Sharing Systems
G. Brandstätter, M. Leitner, and I. Ljubić, Transp. Sci. 54(5): 1408-1438, (2020)On Integer and Bilevel Formulations for the k-Vertex Cut Problem
F. Furini, I. Ljubić, E. Malaguti, P. Paronuzzi, Math. Program. Comput. 12(2): 133-164, (2020)Preface: Decomposition Methods for Hard Optimization Problems
F. Furini, I. Ljubić, E. Traversi, Ann. Oper. Res. 284(2): 483-485, (2020)Virtual Network Functions Placement and Routing Problem: Path formulation
Ahlam Mouaci, Éric Gourdin, Ivana Ljubić, Nancy Perrot, 2020 IFIP Networking Conference (Networking), Paris, France, 2020, pp.55-63, IEEE, (2020)A branch-and-cut algorithm for the Edge Interdiction Clique Problem
F. Furini, I. Ljubić, P. San Segundo, Y. Zhao, Eur. J. Oper. Res. 294(1): 54-69, (2021)An Exact Method for Assortment Optimization under the Nested Logit Model
L. Alfandari, A. Hassanzadeh, I. Ljubić, Eur. J. Oper. Res. 291(3): 830-845, (2021)Benders decomposition for a node-capacitated virtual network functions placement and routing problem
I. Ljubić, A. Mouaci, N. Perrot, E. Gourdin, Comput. Oper. Res. 130: 105227, (2021)Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem
F. Furini, I. Ljubić, E. Malaguti, P. Paronuzzi, Operations Research 70(4): 2399-2420, (2021)New IP-based lower bounds for small Ramsey numbers using circulant graphs
F. Furini, I. Ljubić, P. San Segundo, (2021)Solving Steiner Trees - Recent Advances, Challenges and Perspectives
I. Ljubić, Networks 77(2):177-204, (2021)Survey on Mixed-Integer Programming Techniques in Bilevel Optimization
T. Kleinert, M. Labbé, I. Ljubić, M. Schmidt, EURO J. Comput. Optim. 9: 100007, (2021)The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements
E. Alvarez-Miranda, M. Goycoolea, I. Ljubić, M. Sinnl, Eur. J. Oper. Res. 289(3): 1013-1029, (2021)Combinatorial Optimization (7th International Symposium, ISCO 2022)
Editors: I. Ljubić, F. Barahona, S.S. Dey, A.R. Mahjoub, Springer, (2022)A tailored Benders decomposition approach for last-mile delivery with autonomous robots
L. Alfandari, I. Ljubić, M. Melo da Silva, Eur. J. Oper. Res. 299(2): 510-525, (2022)Budgeting in International Humanitarian Organizations
M. Keshvari Fard, I. Ljubić, F. Papier, Manuf. Serv. Oper. Manag. 24(3): 1562-1577, (2022)Comparison of Formulations for the Inventory Routing Problem
C. Archetti, I. Ljubić, Eur. J. Oper. Res. 303(3): 997-1008, (2022)SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs
Elisabeth Gaar, Jon Lee, Ivana Ljubić, Markus Sinnl, Kübra Taninmis, IPCO: 262-276, (2022)Arc routing with electric vehicles: dynamic charging and speed-dependent energy consumption
E. Fernandez, M. Leitner, I. Ljubić, and M. Ruthmair, Transportation Science 56(5): 1111-1408, C2, (2022)An Exact Method for Fortification Games
M. Leitner, I. Ljubić, M. Monaci, M. Sinnl, K. Taninmis, European Journal of Operational Research (307): 1026--1039, (2022)Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
S. Coniglio, F. Furini, I. Ljubić, Mathematical Programming, 196(1), 9-56 (2022), (2022)Two extended formulations for the Virtual Network Function Placement and Routing Problem
A. Mouaci, I. Ljubić, E. Gourdin, N. Perrot, Networks 82(1): 32-51, (2023)A Brief Introduction to Robust Bilevel Optimization
Y. Beck, I. Ljubić, M. Schmidt, SIAG/OPT Views and News, 30(2), (2023)A Survey on Bilevel Optimization Under Uncertainty
Y. Beck, I. Ljubić, M. Schmidt, European Journal of Operational Research 311(2): 401-426, (2023)Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach
D. Delle Donne, L. Alfandari, C. Archetti, I. Ljubić, Transportation Research, Part B (169): 53-81 , (2023)Emerging Optimization Problems for Distribution in Same-day Delivery
Y. Li, C. Archetti, I. Ljubić, (2023)Connected Facility Location Problems
I. Ljubić, Encyclopedia of Optimization, 3rd edition, 2024 (edited by P. Pardalos and O. Prokopyev), Springer, Cham. https://doi.org/10.1007/978-3-030-54621-2_870-1, (2023)On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
E. Gaar, J. Lee, I. Ljubić, M. Sinnl, K. Tanınmış, Mathematical Programming 206:91-124 (2024), (2023)Mathematical Programming Formulations for the Collapsed k-Core Problem
M. Cerulli, D. Serra, C. Sorgente, C. Archetti, I. Ljubić, European Journal of Operational Research 311(1): 56-72, (2023)Common-Flow Formulations for the Diameter Constrained Spanning and Steiner Tree Problems
L. Gouveia, M. Leitner, I. Ljubić, Combinatorial Optimization and Applications - A Tribute to Bernard Gendron (book edited by T. Crainic, M. Gendreau, A. Frangioni), (2023)Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs
C. Ramirez-Pico, I. Ljubić, E. Moreno, Transportation Science 57(5): 1115-1401, C2 (2023), (2023)Exact Methods for Discrete Γ-Robust Interdiction Problems with an Application to the Bilevel Knapsack Problem
Y. Beck, I. Ljubić, M. Schmidt, Mathematical Programming Computation, Volume 15, pages 733–782, (2023)New formulations for two location problems with interconnected facilities
Y. Kuzbakov, I. Ljubić, European Journal of Operational Research 314(1): 51-65 (2024), (2024)Arc Routing
E. Fernandez, I. Ljubić, J. Rodriguez, W. Yan, (2024)Benders Decomposition for the Discrete Ordered Median Problem
I. Ljubić, M.A. Pozo, J. Puerto, A. Torrejon, European Journal of Operational Research, Volume 317, Issue 3, Pages 858-874, (2024)Exact Algorithms for Continuous Pricing with Advanced Discrete Choice Demand Models
T. Haering, R. Legault, F. Torres, I. Ljubić, M. Bierlaire, (2024)Benders decomposition for congested partial set covering location with uncertain demand
A. Calamita, I. Ljubić, L. Palagi, (2024)The impact of passive social media viewers in influence maximization
M. Kahr, M. Leitner, I. Ljubić, INFORMS Journal on Computing 36(6): 1359-1756, C2, (2024)Heuristic Methods for Mixed-Integer, Linear, and Gamma-Robust Bilevel Problems
Y. Beck, I. Ljubić, M. Schmidt, (2024)Using Disjunctive Cuts in a Branch-and-Cut Method to Solve Convex Integer Nonlinear Bilevel Problems
A. Horländer, I. Ljubić, M. Schmidt, (2024)The Multi-Commodity Flow Problem with Outsourcing Decisions
E. Fernández, I. Ljubić, N. Zarega, (2024)A bilevel approach for compensation and routing decisions in last-mile delivery
M. Cerulli, C. Archetti, E. Fernandez, I. Ljubić, Transportation Science 58(5): 1076-1100, (2024)Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates
Y. Li, C. Archetti, I. Ljubić, Transportation Science 58(5):1143-1165 (2024), (2024)Bilevel optimization with sustainability perspective: A survey on applications
G. Caselli, M. Iori, I. Ljubić, (2024)Three Network Design Problems for Community Energy Storage
B. Ghaddar, I. Ljubić, Y. Qiu, Networks 84(4): 420-445, (2024)BOBILib: Bilevel Optimization (Benchmark) Instance Library
J. Thürauf, T. Kleinert, I. Ljubić, T. Ralphs, M. Schmidt, (2024)Prize Collecting Steiner Tree Problem and its Variants
J. Pedersen, I. Ljubić, Encyclopedia of Optimization, 3rd edition, 2024 (edited by P. Pardalos and O. Prokopyev), Springer, Cham., (2024)talks
Facility Location and Steiner Trees
Published:
A Hybrid VNS for Connected Facility Location
Published:
The Generalized Regenerator Location Problem
Published:
The Generalized Regenerator Location Problem
Published:
The Generalized Regenerator Location Problem
Published:
OptTelNets: Algorithmische Ansätze
Published:
The Generalized Regenerator Location Problem
Published:
Interdiction Games and Monotonicity
Published:
On Clique Interdiction Problems in Graphs
Published:
Very Large Scale Covering Location Problems in the Design of Advanced Metering Infrastructure
Published:
Very Large Scale Covering Location Problems in the Design of Advanced Metering Infrastructure
Published:
Clique Interdiction Attacks in Networks
Published:
Casting Light on the Hidden Bilevel Structure of the Capacitated Vertex Separator Problem
Published:
The Edge Interdiction Clique Problem
Published:
Mixed Integer Bilevel Optimization
Published:
Bilevel Optimization Under Uncertainty
Published:
teaching
Research Supervision
Research - Post Doc