<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Beam Search | AC Group | TU Wien</title><link>https://ac.notready.eu/tag/beam-search/</link><atom:link href="https://ac.notready.eu/tag/beam-search/index.xml" rel="self" type="application/rss+xml"/><description>Beam Search</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 01 Jan 2018 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Beam Search</title><link>https://ac.notready.eu/tag/beam-search/</link></image><item><title>Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging</title><link>https://ac.notready.eu/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-2/</guid><description/></item></channel></rss>