activity
20052023
most citedConstruction of Large Constant Dimension Codes With a Prescribed Minimum Distance

70 citations · 1.1k across the 129 of their papers we have counts for

collaborators
Showing math.OCShow all

11 papers · 1 filter

math.OC2019★ 1 cited

An exact column-generation approach for the lot-type design problem

Miriam Kießling, Sascha Kurz, 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 depe…

math.OC2015★ 20 cited

Dimension of the Lisbon voting rules in the EU Council: a challenge and new world record

Sascha Kurz, Stefan Napel

The new voting system of the Council of the European Union cannot be represented as the intersection of six or fewer weighted games, i.e., its dimension is at least 7. This sets a…

math.OC2014

Optimal Opinion Control: The Campaign Problem

Rainer Hegselmann, Stefan König, Sascha Kurz +2

Opinion dynamics is nowadays a very common field of research. In this article we formulate and then study a novel, namely strategic perspective on such dynamics: There are the usua…

math.OC2014★ 47 cited

Minimal proper non-IRUP instances of the one-dimensional Cutting Stock Problem

Vadim M. Kartak, Sascha Kurz, Artem V. Ripatti +1

We consider the well-known one dimensional cutting stock problem (1CSP). Based on the pattern structure of the classical ILP formulation of Gilmore and Gomory, we can decompose the…

math.OC2014★ 3 cited

The Integrated Size and Price Optimization Problem

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, w…

math.OC2014

Evaluation of a new supply strategy based on stochastic programming for a fashion discounter

Miriam Kießling, Tobias Kreisel, Sascha Kurz +1

Fashion discounters face the problem of ordering the right amount of pieces in each size of a product. The product is ordered in pre-packs containing a certain size-mix of a produc…

math.OC2014

Squaring the square with integer linear programming

Sascha Kurz

We consider so-called squaring the square-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstr…

math.OC2014

The combinatorics of S, M, L, XL - The best fitting delivery of T-shirts

Constantin Gaul, Sascha Kurz, Jörg Rambau

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 deliver…

math.OC2013★ 20 cited

The nucleolus of large majority games

Sascha Kurz, Stefan Napel, Andreas Nohn

Members of a shareholder meeting or legislative committee have greater or smaller voting power than meets the eye if the nucleolus of the induced majority game differs from the vot…

math.OC2008★ 7 cited

The Top-Dog Index: A New Measurement for the Demand Consistency of the Size Distribution in Pre-Pack Orders for a Fashion Discounter with Many Small Branches

Sascha Kurz, Joerg Rambau, Joerg Schluechtermann +1

We propose the new Top-Dog-Index, a measure for the branch-dependent historic deviation of the supply data of apparel sizes from the sales data of a fashion discounter. A common ap…

math.OC2008

Lotsize optimization leading to a -median problem with cardinalities

Constantin Gaul, Sascha Kurz, Joerg Rambau

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 deliver…