<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Andreas M. Chwatal | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/andreas-m.-chwatal/</link><atom:link href="https://ac.tuwien.ac.at/team/andreas-m.-chwatal/index.xml" rel="self" type="application/rss+xml"/><description>Andreas M. Chwatal</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sat, 01 Jan 2011 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Andreas M. Chwatal</title><link>https://ac.tuwien.ac.at/team/andreas-m.-chwatal/</link></image><item><title>A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application</title><link>https://ac.tuwien.ac.at/publication/a-branch-and-cut-and-price-algorithm-for-a-fingerprint-template-compression-application/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-branch-and-cut-and-price-algorithm-for-a-fingerprint-template-compression-application/</guid><description/></item><item><title>Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization</title><link>https://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-ant-colony-optimization/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-ant-colony-optimization/</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>Fitting Multi-Planet Transit Models to CoRoT Time-Data Series by Evolutionary Algorithms</title><link>https://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-corot-time-data-series-by-evolutionary-algorithms/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-corot-time-data-series-by-evolutionary-algorithms/</guid><description/></item><item><title>Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms</title><link>https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms-2/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms-2/</guid><description/></item><item><title>Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms</title><link>https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms/</guid><description/></item><item><title>Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates</title><link>https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates-2/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates-2/</guid><description/></item><item><title>Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates</title><link>https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates/</link><pubDate>Mon, 01 Sep 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates/</guid><description/></item><item><title>Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization</title><link>https://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization/</guid><description/></item><item><title>Determining Orbital Elements of Extrasolar Planets by Evolution Strategies</title><link>https://ac.tuwien.ac.at/publication/determining-orbital-elements-of-extrasolar-planets-by-evolution-strategies/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/determining-orbital-elements-of-extrasolar-planets-by-evolution-strategies/</guid><description/></item></channel></rss>