1. Some results in chromatic scheduling

   • D. de Werra

   OriginalPaper Pages: 167 - 175

2. A decomposition algorithm for shortest paths in a network with many strongly connected components

   • P. Brucker

   OriginalPaper Pages: 177 - 180

3. Polyhedral convexity cuts and negative edge extensions

   • F. Glover

   OriginalPaper Pages: 181 - 186

4. Parameter-free convex equivalent and dual programs of fractional programming problems

   • S. Schaible

   OriginalPaper Pages: 187 - 196

5. Sensitivitätsanalyse für einen Semi-Markov-Prozeß

   • K. -W. Gaede

   OriginalPaper Pages: 197 - 204

6. Efficient and optimal portfolios by homogeneous programming

   • P. van Moeseke
   • B. von Hohenbalken

   OriginalPaper Pages: 205 - 214

7. An iterative method for approximating average cost optimal (s,S) inventory policies

   • H. C. Tijms

   OriginalPaper Pages: 215 - 223

8. Buchbesprechungen

   • B. Korte
   • O. Müller
   • H. M. Dathe

   BookReview Pages: 226 - 236