• Deutsch
Login

OPUS

  • Home
  • Search
  • Browse
  • Publish
  • FAQ
Search Fields

Refine

Author

  • Jörg Rambau (11)
  • Sascha Kurz (5)
  • Cornelius Schwarz (3)
  • Andreas Tuchscherer (1)
  • Constantin Gaul (1)
  • Jörg Rambau (1)
  • Jörg Schlüchtermann (1)
  • Konrad Schade (1)
  • Miriam Kießling (1)
  • Miriam Kießling (1)

Year of publication

  • 2012 (4)
  • 2008 (2)
  • 2010 (2)
  • 2011 (2)
  • 2006 (1)
  • 2007 (1)

Document Type

  • Preprint (9)
  • Article (3)

Language

  • English (12) (remove)

Keywords

  • Branch-and-Bound-Methode (3)
  • Diskrete Optimierung (3)
  • Dynamische Optimierung (3)
  • Operations Research (3)
  • Gemischt-ganzzahlige Optimierung (2)
  • Industrieroboter (2)
  • Revenue Management (2)
  • Zusammenstoß (2)
  • demand forecasting (2)
  • revenue management (2)

Institute

  • Mathematik (12)
  • Wirtschaftswissenschaften (1)

12 search hits

search hits 11 to 12

  • First Page
  • Previous Page

Sort by

  • Year
  • Year
  • Title
  • Title
  • Author
  • Author
Show/Hide Abstract The Integrated Size and Price Optimization problem (2012)
Miriam Kießling Sascha Kurz Jörg Rambau
We present the Integrated Size and Price Optimization Problem (ISPO) for a fashion discounter with many branches. Based on a two-stage stochastic programming model with recourse, we develop an exact algorithm and a production-compliant heuristic that produces small optimality gaps. In a field study we show that a distribution of supply over branches and sizes based on ISPO solutions is significantly better than a one-stage optimization of the distribution ignoring the possibility of optimal pricing.
Show/Hide Abstract An exact column-generation approach for the lot-type design problem (2012)
Sascha Kurz Miriam Kießling Jörg Rambau
We consider a fashion discounter distributing its many branches with integral multiples from a set of available lot-types. For the problem of approximating the branch and size dependent demand using those lots we propose a tailored exact column generation approach assisted by fast algorithms for intrinsic subproblems, which turns out to be very efficient on our real-world instances.

search hits 11 to 12

  • First Page
  • Previous Page

OPUS4 Logo

  • Contact
  • Imprint
  • Sitelinks