<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Karin Oberlechner | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/karin-oberlechner/</link><atom:link href="https://ac.tuwien.ac.at/team/karin-oberlechner/index.xml" rel="self" type="application/rss+xml"/><description>Karin Oberlechner</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>Karin Oberlechner</title><link>https://ac.tuwien.ac.at/team/karin-oberlechner/</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 k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods</title><link>https://ac.tuwien.ac.at/publication/solving-the-k-node-minimum-label-spanning-arborescence-problem-with-exact-and-heuristic-methods/</link><pubDate>Sun, 01 Aug 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-k-node-minimum-label-spanning-arborescence-problem-with-exact-and-heuristic-methods/</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></channel></rss>