Sven Jäger

activity

20182026

most citedAn Optimization Case Study for solving a Transport Robot Scheduling Problem on Quantum-Hybrid and Quantum-Inspired Hardware

13 citations · 36 across the 9 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018★ 3 cited

On orthogonal symmetric chain decompositions

Karl Däubel, Sven Jäger, Torsten Mütze +1

The $n$ -cube is the poset obtained by ordering all subsets of ${1, \dots, n}$ by inclusion, and it can be partitioned into $(⌊ n /2 ⌋ n)$ chains, which is the min…

math.CO2018★ 8 cited

Gray codes and symmetric chains

Petr Gregor, Sven Jäger, Torsten Mütze +2

We consider the problem of constructing a cyclic listing of all bitstrings of length $2 n + 1$ with Hamming weights in the interval $[n + 1 - ℓ, n + ℓ]$ , where $1 \leq ℓ \leq n + 1$ , by…

cs.DM2018★ 4 cited

Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling

Sven Jäger, Martin Skutella

Minimizing the sum of weighted completion times on $m$ identical parallel machines is one of the most important and classical scheduling problems. For the stochastic variant where…