|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ivana Ljubic, Peter Putz, Juan José Salazar González |
Exact approaches to the single-source network loading problem.  |
Networks  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Gollowitzer, Ivana Ljubic |
MIP models for connected facility location: A theoretical and computational study. |
Computers & OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Gollowitzer, Luís Gouveia, Ivana Ljubic |
The Two Level Network Design Problem with Secondary Hop Constraints. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Gollowitzer, Luis Gouveia, Ivana Ljubic |
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivana Ljubic, Peter Putz, Juan José Salazar González |
A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer |
MIP Modeling of Incremental Connected Facility Location. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth |
Exact solutions for the robust prize-collecting steiner tree problem. |
ICUMT |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ivana Ljubic, Stefan Gollowitzer |
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Si Chen, Ivana Ljubic, S. Raghavan |
The regenerator location problem. |
Networks |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivana Ljubic |
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. |
Networks |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel |
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice. |
Math. Program. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel |
Obtaining optimal k-cardinality trees fast. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel |
Obtaining Optimal k-Cardinality Trees Fast. |
ALENEX |
2008 |
DBLP BibTeX RDF |
|
| 1 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel |
Strong Formulations for 2-Node-Connected Steiner Network Problems. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Tomazic, Ivana Ljubic |
A GRASP Algorithm for the Connected Facility Location Problem. |
SAINT |
2008 |
DBLP DOI BibTeX RDF |
GRASP, Connected Facility Location |
| 1 | Ivana Ljubic |
A Hybrid VNS for Connected Facility Location. |
Hybrid Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2006 |
DBLP DOI BibTeX RDF |
Steiner Arborescence, Prize Collecting, Network Design, Branch-and-Cut |
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivana Ljubic, Günther R. Raidl |
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. |
J. Heuristics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher |
The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jozef Kratica, Ivana Ljubic, Dusan Tosic |
A Genetic Algorithm for the Index Selection Problem. |
EvoWorkshops |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Günther R. Raidl, Ivana Ljubic |
Evolutionary local search for the edge-biconnectivity augmentation problem. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandor Kersting, Günther R. Raidl, Ivana Ljubic |
A Memetic Algorithm for Vertex-Biconnectivity Augmentation. |
EvoWorkshops |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jozef Kratica, Dusan Tosic, Vladimir Filipovic, Ivana Ljubic |
Solving the simple plant location problem by genetic algorithm. |
RAIRO - Operations Research |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivana Ljubic, Günther R. Raidl |
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem. |
EvoWorkshops |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivana Ljubic, Günther R. Raidl, Jozef Kratica |
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. |
PPSN |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")