#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1973

2017

- This year (2)
- Last 5 years (19)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Let (Xn, n ≥ 0) be a random dynamical system and its state space be endowed with a reasonable topology. Instead of completing the structure as common by some linearity, this study stresses – motivated in particular by economic applications – order aspects. If the underlying random transformations are supposed to be order-preserving, this results in a fairly… (More)

- Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger
- European Journal of Operational Research
- 2000

We address a variant of the classical knapsack problem in which an upper bound is imposed on the number of items that can be selected. This problem arises in the solution of real-life cutting stock problems by column generation, and may be used to separate cover inequalities with small support within cutting plane approaches to integer linear programs. We… (More)

- Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza
- Oper. Res. Lett.
- 1997

- Alberto Caprara, Hans Kellerer, Ulrich Pferschy
- Inf. Process. Lett.
- 2000

- Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
- SIAM J. Comput.
- 1996

We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total flow time. This problem is well known to be NP-complete, and the best polynomial-time approximation algorithms constructed so far had (more or less trivial) worst-case performance guarantees of O(n). In this paper, we present one… (More)

One of the main advantages of portfolios over single assets is that risk can be diversified without necessarily reducing the expected return — provided the “right” assets are selected and they are assigned the “right” weights. Since in practice investors tend to restrict themselves to a rather small number of different assets, the decision which securities… (More)

- Hans Kellerer, Vitaly A. Strusevich
- Theor. Comput. Sci.
- 2006

- Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
- Discrete Applied Mathematics
- 2004

The bin-packing problem asks for a packing of a list of items of sizes from (0; 1] into the smallest possible number of bins having unit capacity. The k-item bin-packing problem additionally imposes the constraint that at most k items are allowed in one bin. We present two e6cient on-line algorithms for this problem. We show that, for increasing values of… (More)

- Alberto Caprara, Hans Kellerer, Ulrich Pferschy
- RANDOM-APPROX
- 2001