Publications of Ivana Ljubic

Edited Books

  1. Operations Research Proceedings 2015, Editors: Doerner, K., Ljubic, I., Pflug, G., Tragler, G., Springer, 2017.

Articles

  1. M. Fischetti, I. Ljubic, M. Monaci, M. Sinnl: Interdiction Games and Monotonicity, with Application to Knapsack Problems,
    INFORMS Journal on Computing, to appear, 2018 (Technical report)

  2. M. Leitner, I. Ljubic, M. Riedler, M. Ruthmair: Exact Approaches for Network Design Problems with Relays,
    INFORMS Journal on Computing, to appear, 2018 (Technical report)

  3. L. Alfandari, T. Davidovic, F. Furini, I. Ljubic, V. Maras, S. Martin: Tighter MIP formulations for Barge Container Ship Routing,
    Omega, to appear, 2018.

  4. M. Leitner, I. Ljubic, M. Luipersbeck, M. Sinnl: A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
    INFORMS Journal on Computing 30(2):402-420, 2018 (preprint),

  5. M. Fischetti, I. Ljubic, M. Monaci, M. Sinnl: On the Use of Intersection Cuts for Bilevel Optimization,
    Mathematical Programming, to appear, 2018. (preprint)

  6. I. Ljubic, E. Moreno: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities,
    European Journal of Operational Research 266(1): 46-56, 2018 (preprint).

  7. M. Leitner, I. Ljubic, M. Luipersbeck, M. Sinnl: Decomposition methods for the two-stage stochastic Steiner tree problem,
    Computational Optimization and Applications 69(3):713–752, 2018 (preprint).

  8. M. Fischetti, I. Ljubic, M. Monaci, M. Sinnl: A new general-purpose algorithm for mixed-integer bilevel linear programs,
    Operations Research 65(6): 1615-1637, 2017 (preprint)

  9. F. Furini, I. Ljubic and M. Sinnl: An Effective Dynamic Programming Algorithm for the Minimum-Cost Maximal Knapsack Packing Problem,
    European Journal of Operational Research 262(2): 438-448, 2017 (preprint)

  10. M. Ehrgott, I. Ljubic, and S.N. Parragh: Feature Cluster: Recent Advances in Exact Methods for Multi-Objective Optimisation,
    European Journal of Operational Research Volume 260(3): 805-806, 2017

  11. M. Fischetti, I. Ljubic, M. Sinnl: Redesigning Benders Decomposition for Large Scale Facility Location,
    Management Science 63(7): 2146-2162, 2017(technical report).

  12. M. Leitner, I. Ljubic, J.J. Salazar-Gonzalez, M. Sinnl: The Connected Facility Location Polytope,
    Discrete Applied Mathematics 234: 151-167, 2018 (preprint)

  13. M. Leitner, I. Ljubic, J.J. Salazar-Gonzalez, and M. Sinnl: An Algorithmic Framework for the Exact Solution of Tree-Star Problems,
    European Journal of Operational Research 261(1): 54-66, 2017

  14. A. Bley, I. Ljubic, O. Maurer: A Node-Based ILP Formulation for the Node-Weighted Dominating Steiner Problem,
    Networks 69(1): 33-51, 2017 (preprint).

  15. E. Alvarez-Miranda, I. Ljubic, M. Luipersbeck, M. Sinnl: Solving Minimum-Cost Shared Arborescence Problems,
    European Journal of Operational Research 258(3): 887-901, 2017 (preprint).

  16. M. Fischetti, M. Leitner, I. Ljubic, M. Luipersbeck, M. Monaci, M. Resch, D, Salvagnin, M. Sinnl
    Thinning out Steiner trees: A node based model for uniform edge costs,
    Mathematical Programming Computation 9(2): 203-229, 2017.

  17. I. Ljubic, P. Mutzel, B. Zey: Stochastic Survivable Network Design Problems: Theory and Practice,
    European Journal of Operational Research, 256 (2): 333-348, 2017 (preprint).

  18. M. Fischetti, I. Ljubic, M. Sinnl: Benders decomposition without separability: A computational study for capacitated facility location problems,
    European Journal of Operational Research 253(3): 557-569, 2016. (preprint)

  19. M. Sinnl, I. Ljubic: A Node-Based Layered Graph Approach for the Steiner Tree Problem with Revenues, Budget and Hop-Constraints,
    Mathematical Programming Computation 8(4): 461-490, 2016.

  20. M. Fischetti, I. Ljubic, M. Monaci, M. Sinnl: Intersection Cuts for Bilevel Optimization,
    IPCO 2016, Springer, Volume 9682 of Lecture Notes in Computer Science, pp 77-88, 2016.

  21. M. Leitner, I. Ljubic, M. Sinnl, A. Werner: ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design,
    Computers and Operations Research, Volume 72, 128-146, 2016. (preprint)

  22. E. Alvarez-Miranda, E. Fernandez, I. Ljubic: The Recoverable Robust Facility Location Problem,
    Transportation Research Part B, 79: 93-120, 2015 (preprint)

  23. S. Chen, I. Ljubic, S. Raghavan: The Generalized Regenerator Location Problem,
    INFORMS Journal on Computing 27(2): 204 - 220, 2015.

  24. F. Furini, I. Ljubic, M. Sinnl: ILP and CP Formulations for the Lazy Bureaucrat Problem,
    CPAIOR 2015, Volume 9075 of Lecture Notes in Computer Science, pp. 255-270, 2015.

  25. L. Gouveia, M. Leitner, I. Ljubic: The Two-Level Diameter Constrained Spanning Tree Problem,
    Mathematical Programming 150(1):49-78, 2015 (Technical Report).

  26. M. Leitner, I. Ljubic, M. Sinnl: The bi-objective prize-collecting Steiner tree problem,
    INFORMS Journal on Computing 27(1): 118-134, 2014 (preprint)

  27. L. Gouveia, M. Leitner, I. Ljubic: Hop Constrained Steiner Trees with multiple Root Nodes,
    European Journal of Operational Research, 236(1):100-112, 2014 (preprint)

  28. E. Alvarez-Miranda, I. Ljubic, S. Raghavan, P. Toth: The Recoverable Robust Two-Level Network Design Problem,
    INFORMS Journal on Computing 27(1): 1-19, 2014 (preprint)

  29. I. Ljubic. P. Putz, and J.J. Salazar-Gonzalez: A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem,
    European Journal of Operational Research 235(3):727-739, 2014 (preprint)

  30. M. Leitner, I. Ljubic, J.J. Salazar-Gonzalez, M. Sinnl
    On the Asymmetric Connected Facility Location Polytope,
    ISCO 2014, volume 8596 Lecture Notes in Computer Science, pp. 371-383, 2014 (preprint).

  31. M. Leitner, I. Ljubic, M. Luipersbeck, M. Resch
    A partition-based heuristic for the Steiner tree problem in large graphs,
    HM 2014, volume 8457 of Lecture Notes in Computer Science, pp. 56-70, 2014 (preprint).

  32. I. Ljubic, S. Gollowitzer: Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem,
    INFORMS Journal on Computing 25(2): 256-270, 2013 Technical Report Nr. [2010-08],

  33. E. Alvarez-Miranda, I. Ljubic, P. Mutzel
    The Maximum Weight Connected Subgraph Problem
    In: M. Jünger and G. Reinelt, Facets of Combinatorial Optimization, pp. 245-270, Springer, 2013. (preprint)

  34. A. Bley, I. Ljubic, O. Maurer: Lagrangian Decompositions for the Two-Level FTTx Network Design Problem,
    EURO Journal on Computational Optimization 1(3): 221-252, 2013 (preprint)

  35. S. Gollowitzer, B. Gendron, I. Ljubic: A cutting plane algorithm for the capacitated connected facility location problem,
    Computational Optimization and Applications 55(3), pp 647-674, 2013 (preprint)

  36. E. Alvarez-Miranda, I. Ljubic, P. Toth: Exact Approaches for Solving Robust Prize-Collecting Steiner Tree Problems,
    European Journal of Operational Research 229(3): 599-612, 2013 (preprint)

  37. E. Alvarez-Miranda, I. Ljubic, P. Toth: A Note on the Bertsimas and Sim Algorithm for Robust Combinatorial Optimization Problems,
    4OR 11(4): 349-360, 2013 (preprint)

  38. S. Gollowitzer, L. Gouveia, I. Ljubic: Enhanced Formulations and Branch-and-Cut for the Two Level Network Design Problem with Transition Facilities,
    European Journal of Operational Research 225(2): 211-222, 2013 (preprint)

  39. I. Ljubic, P. Mutzel, B. Zey
    Stochastic Survivable Network Design Problems
    INOC 2013, volume 41 of Electronic Notes in Discrete Mathematics, pp. 245-252, 2013 (Technical Report)

  40. M. Leitner, I. Ljubic, and M. Sinnl.
    Solving the bi-objective prize-collecting Steiner tree problem with the e-constraint method.
    INOC 2013, volume 41 of Electronic Notes in Discrete Mathematics, pp. 181-188, 2013. (preprint)

  41. M. Leitner, I. Ljubic, M. Sinnl, and A. Werner.
    On the two-architecture connected facility location problem.
    INOC 2013, volume 41 of Electronic Notes in Discrete Mathematics, pp. 359-366, 2013. (preprint)

  42. E. Alvarez-Miranda, I. Ljubic, P. Mutzel
    The Rooted Maximum Node-Weight Connected Subgraph Problem
    CPAIOR 2013, Volume 7874 of Lecture Notes in Computer Science, pp. 300-315, 2013 (preprint)

  43. F. Frommlet, I. Ljubic, H.B. Arnardóttir, M. Bogdan: QTL Mapping Using a Memetic Algorithm with Modifications of BIC as Fitness Function,
    Statistical Applications in Genetics and Molecular Biology. Volume 11, Issue 4, Art. 2, 2012

  44. I. Ljubic. P. Putz, and J.J. Salazar-Gonzalez: Exact Approaches to the Single-Source Network Loading Problem
    Networks 59(1): 89-106, 2012, Technical Report Nr. [2009-05]

  45. J. Kratica, M. Leitner, I. Ljubic
    Variable Neighborhood Search for Solving the Balanced Location Problem
    EUROmC XXVIII VNS, Volume 39 of Electronic Notes in Discrete Mathematics, pp. 21-28, 2012.

  46. L. Gouveia, M. Leitner, I. Ljubic
    On the Hop Constrained Steiner Tree Problem with multiple Root Nodes
    ISCO 2012, Volume 7422 of Lecture Notes in Computer Science, pp. 201-212, 2012.

  47. S. Gollowitzer, I. Ljubic: MIP Models for Connected Facility Location: A Theoretical and Computational Study,
    Computers & Operations Research 38(2): 435-449, 2011, Technical Report Nr. [2009-07]

  48. E. Alvarez-Miranda, I. Ljubic, P. Toth
    Exact Solutions for the Robust Prize-Collecting Steiner Tree Problem
    RNDM 2011, IEEE Xplore, ISSN: 2157-0221, pp. 1-7, 2011 (preprint)

  49. A. Arulselvan, A. Bley, S. Gollowitzer, I. Ljubic and O. Maurer
    MIP modeling of Incremental Connected Facility Location
    INOC 2011, Volume 6701 of Lecture Notes in Computer Science, pp. 490-502, 2011. (preprint)

  50. S. Gollowitzer, L. Gouveia and I. Ljubic
    A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
    INOC 2011, Volume 6701 of Lecture Notes in Computer Science, pp. 57-70, 2011. (preprint)

  51. M. Chimani, M. Kandyba, I. Ljubic, and P. Mutzel: Orientation-based Models for {0,1,2}-Survivable Network Design: Theory and Practice
    Mathematical Programming, 124 (1-2): 413-440, 2010, (preprint)

  52. I. Ljubic: A Branch-and-Cut-and-Price Algorithm for Vertex Biconnectivity Augmentation,
    Networks 56(3): 169-182, 2010, Technical Report Nr. [2009-02]

  53. S. Chen, I. Ljubic, and S. Raghavan: The regenerator location problem
    Networks 55(3): 205-220, 2010 (preprint)

  54. I. Bomze, M. Chimani, M. Jünger, I. Ljubic, P. Mutzel, B. Zey
    Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
    ISAAC 2010, Volume 6506 of Lecture Notes in Computer Science, pp. 427-439, 2010. (preprint)

  55. I. Ljubic, S. Gollowitzer
    Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs,
    ISCO 2010, Electronic Notes in Discrete Mathematics 36 (2010), 207-214 (preprint)

  56. M. Chimani, M. Kandyba, I. Ljubic, and P. Mutzel: Obtaining Optimal k-Cardinality Trees Fast
    ACM Journal of Experimental Algorithmics, 14(2): 5.1-5.23, 2009 (preprint)

  57. I. Ljubic. P. Putz, J.J. Salazar
    Exact Approaches to the Single-Source Network Loading Problem
    INOC 2009

  58. S. Chen, I. Ljubic, S. Raghavan
    The Generalized Regenerator Location Problem
    INOC 2009

  59. M. Chimani, M. Kandyba, I. Ljubic, and P. Mutzel.
    Strong Formulations for 2-Node-Connected Steiner Network Problems.
    COCOA 2008, Volume 5165 of Lecture Notes in Computer Science, pp. 190-200, 2008.

  60. A. Tomazic, I. Ljubic
    A GRASP Algorithm for Connected Facility Location
    2008 International Symposium on Applications and the Internet, IEEE CS Press, pp. 257-260, 2008.

  61. M. Chimani, M. Kandyba, I. Ljubic, and P. Mutzel
    Obtaining Optimal k-Cardinality Trees Fast
    ALENEX 2008, SIAM, pp. 27-36, 2008.

  62. I. Ljubic
    A Hybrid VNS for Connected Facility Location
    Hybrid Metaheuristics 2007, Volume 4771 of Springer Lecture Notes in Computer Science, pp. 157-169, 2007.

  63. I. Ljubic, R. Weiskircher, U. Pferschy, G. Klau, P. Mutzel, and M. Fischetti: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
    Mathematical Programming, 105(2-3):427-449, 2006 (preprint)

  64. I. Ljubic, R. Weiskircher, U. Pferschy, G. Klau, P. Mutzel, and M. Fischetti
    Solving the prize-collecting Steiner tree problem to optimality.
    ALENEX 2005, SIAM, pp. 68-76, 2005. ISBN 0-89871-596-2.

  65. G.W. Klau, I. Ljubic, A. Moser, P. Mutzel, P. Neuner, U. Pferschy G. Raidl, and R. Weiskircher
    Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem.
    GECCO 2004, Volume 3102 of Springer Lecture Notes in Computer Science, pp. 1304-1315, 2004.

  66. I. Ljubic and G. R. Raidl: A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs.
    Journal of Heuristics, 9(5):401-428, 2003. Previous technical report.

  67. G.W. Klau, I. Ljubic, P. Mutzel, U. Pferschy, R. Weiskircher
    The Fractional Prize-Collecting Steiner Tree Problem on Trees
    ESA 2003, Volume 2832 of Springer Lecture Notes in Computer Science, pp. 691-702, 2003.

  68. J. Kratica, I. Ljubic, and D. Tosic
    A genetic algorithm for the index selection problem
    EvoWorkshops 2003, Volume 2611 of Springer Lecture Notes in Computer Science, pp. 280-290, 2003.

  69. G. R. Raidl and I. Ljubic: Evolutionary local search for the edge-biconnectivity augmentation problem.
    Information Processing Letters, 82(1):39-45, 2002. Previous technical report.

  70. S. Kersting, G. R. Raidl, and I. Ljubic
    A Memetic Algorithm for Vertex-Biconnectivity Augmentation
    EvoWorkshops 2002, Volume 2279 of Springer Lecture Notes in Computer Science, pp. 102-111, 2002

  71. J. Kratica, D. Tosic, V. Filipovic, and I. Ljubic: Solving the simple plant location problem by genetic algorithms.
    RAIRO - Operations Research, 35(1):127-142, 2001.

  72. I. Ljubic, and G. R. Raidl
    An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
    EvoWorkshops 2001, Volume 2037 of Springer Lecture Notes in Computer Science, pp. 20-29, 2001

  73. I. Ljubic, G. R. Raidl, and J. Kratica
    A Hybrid GA for the Edge- Biconnectivity Augmentation Problem.
    PPSN 2000, Volume 1917 of Springer Lecture Notes in Computer Science, pp. 641-650, 2000

  74. I. Ljubic and J. Kratica
    A genetic algorithm for the biconnectivity augmentation problem.
    IEEE Congress on Evolutionary Computation 2000, IEEE Press, pp. 89-96, 2000.

Technical Reports / Submitted Papers

  1. J.F. Cordeau, F. Furini, I. Ljubic
    Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Problems, submitted, 2018.
  2. M. Leitner, I. Ljubic, M. Riedler, M. Ruthmair
    Exact approaches for the directed network design problem with relays, submitted, 2018.
  3. E. Alvarez-Miranda, M. Goycoolea, I. Ljubic, M. Sinnl,
    The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements, submitted, 2018.
  4. A. Arulselvan, A. Bley, I. Ljubic
    MIP Modeling of Incremental Connected Facility Location, submitted, 2018.
  5. F. Furini, I. Ljubic. P. San Segundo, S. Martin,
    The Maximum Clique Interdiction Game, submitted, 2018.
  6. G. Brandstätter, M. Leitner, and I. Ljubic,
    Location of Charging Stations in Electric Car Sharing Systems, submitted, 2016.
  7. L. Gouveia, M. Leitner, I. Ljubic.
    A polyhedral study of the diameter constrained minimum spanning tree problem, submitted, 2014.

PhD Thesis