<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Grasp | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/tag/grasp/</link><atom:link href="https://ac.tuwien.ac.at/tag/grasp/index.xml" rel="self" type="application/rss+xml"/><description>Grasp</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Fri, 01 Jan 2016 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Grasp</title><link>https://ac.tuwien.ac.at/tag/grasp/</link></image><item><title>Particle Therapy Patient Scheduling: First Heuristic Approaches</title><link>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-first-heuristic-approaches/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-first-heuristic-approaches/</guid><description/></item><item><title>Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation</title><link>https://ac.tuwien.ac.at/publication/solving-a-multi-constrained-network-design-problem-by-lagrangean-decomposition-and-column-generation/</link><pubDate>Wed, 01 Apr 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-a-multi-constrained-network-design-problem-by-lagrangean-decomposition-and-column-generation/</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>