Ivana Ljubic

Stefan Gollowitzer, Luis Gouveia, Ivana 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)

Eduardo Álvarez-Miranda, Ivana Ljubic, Petra Mutzel: The Rooted Maximum Node-Weight Connected Subgraph Problem. CPAIOR 2013: 300-315

Jozef Kratica, Markus Leitner, Ivana Ljubic: Variable Neighborhood Search for Solving the Balanced Location Problem. Electronic Notes in Discrete Mathematics 39: 21-28 (2012)

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

Luis Gouveia, Markus Leitner, Ivana Ljubic: On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. ISCO 2012: 201-212

Stefan Gollowitzer, Ivana Ljubic: MIP models for connected facility location: A theoretical and computational study. Computers & OR 38(2): 435-449 (2011)

Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth: Exact solutions for the robust prize-collecting steiner tree problem. ICUMT 2011: 1-7

Stefan Gollowitzer, Luis Gouveia, Ivana Ljubic: A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes. INOC 2011: 57-70

Stefan Gollowitzer, Luís Gouveia, Ivana Ljubic: The Two Level Network Design Problem with Secondary Hop Constraints. INOC 2011: 71-76

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

Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer: MIP Modeling of Incremental Connected Facility Location. INOC 2011: 490-502

Ivana Ljubic, Stefan Gollowitzer: Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs. Electronic Notes in Discrete Mathematics 36: 207-214 (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): 413-439 (2010)

Si Chen, Ivana Ljubic, S. Raghavan: The regenerator location problem. Networks 55(3): 205-220 (2010)

Ivana Ljubic: A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. Networks 56(3): 169-182 (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: 427-439

Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Obtaining optimal k-cardinality trees fast. ACM Journal of Experimental Algorithmics 14 (2009)

Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Obtaining Optimal k-Cardinality Trees Fast. ALENEX 2008: 27-36

Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Strong Formulations for 2-Node-Connected Steiner Network Problems. COCOA 2008: 190-200

Alessandro Tomazic, Ivana Ljubic: A GRASP Algorithm for the Connected Facility Location Problem. SAINT 2008: 257-260

Ivana Ljubic: A Hybrid VNS for Connected Facility Location. Hybrid Metaheuristics 2007: 157-169

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): 427-449 (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: 68-76

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: 1304-1315

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

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

Jozef Kratica, Ivana Ljubic, Dusan Tosic: A Genetic Algorithm for the Index Selection Problem. EvoWorkshops 2003: 280-290

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

Sandor Kersting, Günther R. Raidl, Ivana Ljubic: A Memetic Algorithm for Vertex-Biconnectivity Augmentation. EvoWorkshops 2002: 102-111

Jozef Kratica, Dusan Tosic, Vladimir Filipovic, Ivana Ljubic: Solving the simple plant location problem by genetic algorithm. RAIRO - Operations Research 35(1): 127-142 (2001)

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

Ivana Ljubic, Günther R. Raidl, Jozef Kratica: A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. PPSN 2000: 641-650