<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Cutting | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/tag/cutting/</link><atom:link href="https://ac.tuwien.ac.at/tag/cutting/index.xml" rel="self" type="application/rss+xml"/><description>Cutting</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Tue, 01 Mar 2016 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Cutting</title><link>https://ac.tuwien.ac.at/tag/cutting/</link></image><item><title>Column Generation at Strip Level for the k-Staged Two-Dimensional Cutting Stock Problem</title><link>https://ac.tuwien.ac.at/publication/column-generation-at-strip-level-for-the-k-staged-two-dimensional-cutting-stock-problem/</link><pubDate>Tue, 01 Mar 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/column-generation-at-strip-level-for-the-k-staged-two-dimensional-cutting-stock-problem/</guid><description/></item><item><title>A Branch-and-Bound Approach for the Constrained k-Staged 2-Dimensional Cutting Stock Problem</title><link>https://ac.tuwien.ac.at/publication/a-branch-and-bound-approach-for-the-constrained-k-staged-2-dimensional-cutting-stock-problem/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-branch-and-bound-approach-for-the-constrained-k-staged-2-dimensional-cutting-stock-problem/</guid><description/></item><item><title>A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size</title><link>https://ac.tuwien.ac.at/publication/a-value-correction-construction-heuristic-for-the-two-dimensional-cutting-stock-problem-with-variable-sheet-size/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-value-correction-construction-heuristic-for-the-two-dimensional-cutting-stock-problem-with-variable-sheet-size/</guid><description/></item><item><title>Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/solving-the-3-staged-2-dimensional-cutting-stock-problem-by-dynamic-programming-and-variable-neighborhood-search/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-3-staged-2-dimensional-cutting-stock-problem-by-dynamic-programming-and-variable-neighborhood-search/</guid><description/></item><item><title>A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem</title><link>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-using-very-large-neighborhood-structures-for-the-3-staged-2-dimensional-cutting-stock-problem/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-using-very-large-neighborhood-structures-for-the-3-staged-2-dimensional-cutting-stock-problem/</guid><description/></item></channel></rss>