#### Filter Results:

- Full text PDF available (51)

#### Publication Year

2000

2018

- This year (7)
- Last 5 years (40)
- Last 10 years (71)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
- Math. Program.
- 2006

The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus the total… (More)

- Stefan Gollowitzer, Ivana Ljubic
- Computers & OR
- 2011

This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines facility location… (More)

- Ivana Ljubic
- Hybrid Metaheuristics
- 2007

The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆ V , a set of… (More)

- Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
- ALENEX/ANALCO
- 2005

The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus the total… (More)

- Si Chen, Ivana Ljubic, S. Raghavan
- Networks
- 2010

In this paper we introduce the regenerator location problem (RLP), which deals with a constraint on the geographical extent of transmission in optical networks. Specifically, an optical signal can… (More)

- Jozef Kratica, Dusan Tosic, Vladimir Filipovic, Ivana Ljubic
- RAIRO - Operations Research
- 2001

The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000… (More)

- Alessandro Tomazic, Ivana Ljubic
- 2008 International Symposium on Applications and…
- 2008

We apply a greedy randomized adaptive search procedure (GRASP) to solve the connected facility location problem heuristically. Diversification property is assured by applying a randomized greedy… (More)

- Ivana Ljubic
- 2004

This thesis focuses on two combinatorial optimization problems (COPs) that belong to the class of NP-hard network design problems: The first one, vertex biconnectivity augmentation (V2AUG), appears… (More)

- Ivana Ljubic, Stefan Gollowitzer
- INFORMS Journal on Computing
- 2013

Given a set of customers, a set of potential facility locations and some inter-connection nodes, the goal of the Connected Facility Location problem (ConFL) is to find the minimum-cost way of… (More)

The Maximum (Node-) Weight Connected Subgraph Problem (MWCS) searches for a connected subgraph with maximum total weight in a node-weighted (di)graph. In this work we introduce a new integer linear… (More)