<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
  <channel>
    <title>OPUS 4 Latest Documents RSS Feed</title>
    <description>Latest documents</description>
    <link>http://opus4.kobv.de/opus4-ubbayreuth/index/index/</link>
    <pubDate>Wed, 15 Oct 2008 08:11:51 +0200</pubDate>
    <lastBuildDate>Wed, 15 Oct 2008 08:11:51 +0200</lastBuildDate>
    <item>
      <title>On the benefits of using NP-hard problems in Branch &amp; Bound</title>
      <link>http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/417</link>
      <description>We present a Brand-and-Bound (B&amp;B) method using combinatorial bounds for solving makespan minimization problems with sequence dependent setup costs. As an application we present a laser source sharing problem arising in car manufacturing.</description>
      <author>Jörg Rambau; Cornelius Schwarz</author>
      <category>article</category>
      <guid>http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/417</guid>
      <pubDate>Wed, 15 Oct 2008 08:11:51 +0200</pubDate>
    </item>
  </channel>
</rss>
