<?xml version="1.0" encoding="utf-8"?>


    <rss version="2.0"
         xmlns:content="http://purl.org/rss/1.0/modules/content/"
         xmlns:atom="http://www.w3.org/2005/Atom"
         xmlns:media="http://search.yahoo.com/mrss/">
        <channel>
            
                
                    <ttl>60</ttl>
                    <title>University of Bremen - Winter 2016/2017</title>
                    <link>https://www.uni-bremen.de/en/cslog-1/teaching/winter-2016-2017</link>
                    <description>This is the teaching homepage of the working group CSLog led by Prof. Dr. Nicole Megow for the Winter Semester 16/17.</description>
                    <language>en</language>
                    <copyright>University of Bremen</copyright>
                    <pubDate>Sun, 05 Apr 2026 00:47:51 +0200</pubDate>
                    <lastBuildDate>Sun, 05 Apr 2026 00:47:51 +0200</lastBuildDate>
                    <atom:link href="https://www.uni-bremen.de/en/cslog-1/teaching/winter-2016-2017/rss.xml" rel="self" type="application/rss+xml"/>
                    <generator>University of Bremen</generator>
                
                
                    
                        <item>
                            <guid isPermaLink="false">content-311029</guid>
                            <pubDate>Thu, 05 Mar 2026 09:46:29 +0100</pubDate>
                            <title>Combinatorial Optimization in Logistics and Production Planning</title>
                            <link>https://www.uni-bremen.de/en/cslog-1/teaching/winter-2016-2017#c311029</link>
                            
                            <description>&amp;lt;h4&amp;gt;Advanced Course (Master Ergänzungsveranstaltung)&amp;lt;/h4&amp;gt;
&amp;lt;p&amp;gt;Optimization plays a crucial role in the planning of modern logistics operations and production processes. This course introduces basic combinatorial optimization problems such as scheduling, packing, matching, routing and network-design that are ubiquitous in production, logistics or transportation. We design and analyze efficient and approximate algorithms to solve such problems and discuss their computational complexity. The focus lies on rigorous proofs of optimality or worst-case performance guarantees.&amp;lt;br /&amp;gt; &amp;lt;br /&amp;gt; &amp;lt;a href=&amp;quot;https://elearning.uni-bremen.de/dispatch.php/course/overview?cid=3d6314f61331137858b7734b11976b53&amp;quot;&amp;gt;link to the Stud.IP website of the class&amp;lt;/a&amp;gt;&amp;lt;/p&amp;gt;
&amp;lt;p&amp;gt;&amp;lt;strong&amp;gt;Instructors: &amp;lt;/strong&amp;gt;&amp;lt;/p&amp;gt;
&amp;lt;ul&amp;gt; 	&amp;lt;li&amp;gt;&amp;lt;a class=&amp;quot;internalLink&amp;quot; href=&amp;quot;t3://page?uid=18311&amp;quot; target=&amp;quot;_blank&amp;quot;&amp;gt;Prof. Dr. Nicole Megow&amp;lt;/a&amp;gt;&amp;lt;/li&amp;gt; 	&amp;lt;li&amp;gt;Dr. Marek Adamczyk&amp;lt;/li&amp;gt; 	&amp;lt;li&amp;gt;Dr. Syamantak Das&amp;lt;/li&amp;gt; &amp;lt;/ul&amp;gt;
&amp;lt;p&amp;gt;&amp;lt;strong&amp;gt;Time &amp;amp;amp; room: &amp;lt;/strong&amp;gt;&amp;lt;/p&amp;gt;
&amp;lt;ul&amp;gt; 	&amp;lt;li&amp;gt;Wed 8-10 in room MHZ 1100 (lecture)&amp;lt;/li&amp;gt; 	&amp;lt;li&amp;gt;Wed 10-12 in room MHZ 1100 (exercise)&amp;lt;/li&amp;gt; &amp;lt;/ul&amp;gt;
&amp;lt;p&amp;gt;&amp;lt;strong&amp;gt;Start: &amp;lt;/strong&amp;gt;Wednesday, October 19, 2016. Exercise sessions start in the second week on October 26, 2016.&amp;lt;/p&amp;gt;
&amp;lt;p&amp;gt;&amp;lt;strong&amp;gt;Course no:&amp;lt;/strong&amp;gt; 03-ME-601.99a&amp;lt;/p&amp;gt;
&amp;lt;p&amp;gt;&amp;lt;strong&amp;gt;Credit:&amp;lt;/strong&amp;gt; 6 ETCS&amp;lt;/p&amp;gt;</description>
                            
                            <category>Content</category>
                            
                            
                        </item>
                    
                
            
        </channel>
    </rss>

