<?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>Tue, 15 Apr 2008 10:55:26 +0200</pubDate>
    <lastBuildDate>Tue, 15 Apr 2008 10:55:26 +0200</lastBuildDate>
    <item>
      <title>Lotsize optimization leading to a p-median problem with cardinalities</title>
      <link>http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/373</link>
      <description>We consider the problem of approximating the branch and size dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available lot-types. We propose a formalized model which arises from a practical cooperation with an industry partner. Besides an integer linear programming formulation and a primal heuristic for this problem we also consider a more abstract version which we relate to several other classical optimization problems like the p-median problem, the facility location problem or the matching problem.</description>
      <author>Constantin Gaul; Sascha Kurz; Jörg Rambau</author>
      <category>preprint</category>
      <guid>http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/373</guid>
      <pubDate>Tue, 15 Apr 2008 10:55:26 +0200</pubDate>
    </item>
  </channel>
</rss>
