Stochastic scheduling problems II-set strategies- R. H. MöhringF. J. RadermacherG. Weiss OriginalPaper Pages: 65 - 104
A hybrid algorithm for solving convex separable network flow problems Katharina Belling-Seib OriginalPaper Pages: 105 - 123
Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs H. Späth OriginalPaper Pages: 125 - 131