<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>I. Ljubić | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/i.-ljubic/</link><atom:link href="https://ac.tuwien.ac.at/team/i.-ljubic/index.xml" rel="self" type="application/rss+xml"/><description>I. Ljubić</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Tue, 01 Jan 2019 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>I. Ljubić</title><link>https://ac.tuwien.ac.at/team/i.-ljubic/</link></image><item><title>Exact Approaches for Network Design Problems with Relays</title><link>https://ac.tuwien.ac.at/publication/exact-approaches-for-network-design-problems-with-relays/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/exact-approaches-for-network-design-problems-with-relays/</guid><description/></item><item><title>A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-minimum-cost-vertex-biconnectivity-augmentation-of-graphs/</link><pubDate>Wed, 01 Jan 2003 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-minimum-cost-vertex-biconnectivity-augmentation-of-graphs/</guid><description/></item><item><title>A Memetic Algorithm for Vertex-Biconnectivity Augmentation</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-vertex-biconnectivity-augmentation/</link><pubDate>Tue, 01 Jan 2002 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-vertex-biconnectivity-augmentation/</guid><description/></item><item><title>Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem</title><link>https://ac.tuwien.ac.at/publication/evolutionary-local-search-for-the-edge-biconnectivity-augmentation-problem/</link><pubDate>Tue, 01 Jan 2002 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/evolutionary-local-search-for-the-edge-biconnectivity-augmentation-problem/</guid><description/></item><item><title>An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-stochastic-hill-climbing-for-the-edge-biconnectivity-augmentation-problem/</link><pubDate>Mon, 01 Jan 2001 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-stochastic-hill-climbing-for-the-edge-biconnectivity-augmentation-problem/</guid><description/></item><item><title>A Hybrid GA for the Edge-Biconnectivity Augmentation Problem</title><link>https://ac.tuwien.ac.at/publication/a-hybrid-ga-for-the-edge-biconnectivity-augmentation-problem/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-hybrid-ga-for-the-edge-biconnectivity-augmentation-problem/</guid><description/></item></channel></rss>