| 2008 |
|---|
| 14 | EE | Markus Chimani,
Maria Kandyba,
Ivana Ljubic,
Petra Mutzel:
Obtaining Optimal k-Cardinality Trees Fast.
ALENEX 2008: 27-36 |
| 13 | EE | Markus Chimani,
Maria Kandyba,
Ivana Ljubic,
Petra Mutzel:
Strong Formulations for 2-Node-Connected Steiner Network Problems.
COCOA 2008: 190-200 |
| 12 | EE | Alessandro Tomazic,
Ivana Ljubic:
A GRASP Algorithm for the Connected Facility Location Problem.
SAINT 2008: 257-260 |
| 2007 |
|---|
| 11 | EE | Ivana Ljubic:
A Hybrid VNS for Connected Facility Location.
Hybrid Metaheuristics 2007: 157-169 |
| 2006 |
|---|
| 10 | EE | 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) |
| 2005 |
|---|
| 9 | EE | 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 |
| 2004 |
|---|
| 8 | EE | 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 |
| 2003 |
|---|
| 7 | EE | 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 |
| 6 | EE | Jozef Kratica,
Ivana Ljubic,
Dusan Tosic:
A Genetic Algorithm for the Index Selection Problem.
EvoWorkshops 2003: 280-290 |
| 5 | | Ivana Ljubic,
Günther R. Raidl:
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs.
J. Heuristics 9(5): 401-427 (2003) |
| 2002 |
|---|
| 4 | EE | Sandor Kersting,
Günther R. Raidl,
Ivana Ljubic:
A Memetic Algorithm for Vertex-Biconnectivity Augmentation.
EvoWorkshops 2002: 102-111 |
| 3 | EE | Günther R. Raidl,
Ivana Ljubic:
Evolutionary local search for the edge-biconnectivity augmentation problem.
Inf. Process. Lett. 82(1): 39-45 (2002) |
| 2001 |
|---|
| 2 | EE | Ivana Ljubic,
Günther R. Raidl:
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem.
EvoWorkshops 2001: 20-29 |
| 2000 |
|---|
| 1 | | Ivana Ljubic,
Günther R. Raidl,
Jozef Kratica:
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem.
PPSN 2000: 641-650 |
