<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Jonas Mayerhofer | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/jonas-mayerhofer/</link><atom:link href="https://ac.tuwien.ac.at/team/jonas-mayerhofer/index.xml" rel="self" type="application/rss+xml"/><description>Jonas Mayerhofer</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sun, 01 May 2022 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Jonas Mayerhofer</title><link>https://ac.tuwien.ac.at/team/jonas-mayerhofer/</link></image><item><title>Minimizing Makespan in Flow Shops with a Reinforcement Learning Like Approach</title><link>https://ac.tuwien.ac.at/publication/minimizing-makespan-in-flow-shops-with-a-reinforcement-learning-like-approach/</link><pubDate>Sun, 01 May 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/minimizing-makespan-in-flow-shops-with-a-reinforcement-learning-like-approach/</guid><description/></item><item><title>A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation</title><link>https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation-2/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation-2/</guid><description/></item><item><title>A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation</title><link>https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation/</guid><description/></item></channel></rss>