<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>VND | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/tag/vnd/</link><atom:link href="https://ac.tuwien.ac.at/tag/vnd/index.xml" rel="self" type="application/rss+xml"/><description>VND</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sun, 01 Jan 2017 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>VND</title><link>https://ac.tuwien.ac.at/tag/vnd/</link></image><item><title>Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control</title><link>https://ac.tuwien.ac.at/publication/efficient-consideration-of-soft-time-windows-in-a-large-neighborhood-search-for-the-districting-and-routing-problem-for-security-control/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/efficient-consideration-of-soft-time-windows-in-a-large-neighborhood-search-for-the-districting-and-routing-problem-for-security-control/</guid><description/></item><item><title>A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</guid><description/></item></channel></rss>