1. Minimizing the Number of Late Jobs under the Group Technology Assumption

   • Zhaohui Liu
   • Wenci Yu

   OriginalPaper Pages: 5 - 15

2. Reduction of the Three-Partition Problem

   • Mauro Dell'Amico
   • Silvano Martello

   OriginalPaper Pages: 17 - 30

3. A Probabilistic Analysis of the Capacitated Facility Location Problem

   • Nanda Piersma

   OriginalPaper Pages: 31 - 50

4. The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices

   • Bettina Klinz
   • Gerhard J. Woeginger

   OriginalPaper Pages: 51 - 58

5. A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem

   • Hans Kellerer
   • Ulrich Pferschy

   OriginalPaper Pages: 59 - 71

6. Analysis of the List Scheduling Algorithm for Precedence Constrained Parallel Tasks

   • Keqin Li

   OriginalPaper Pages: 73 - 88

7. A Note on the Max-Min 0-1 Knapsack Problem

   • Hiroshi Iida

   OriginalPaper Pages: 89 - 94

8. Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT

   • M. Yagiura
   • T. Ibaraki

   OriginalPaper Pages: 95 - 114

9. Inverse Polymatroidal Flow Problem

   • Mao-Cheng Cai
   • Xiaoguang Yang
   • Yanjun Li

   OriginalPaper Pages: 115 - 126

10. Solution Structure of Some Inverse Combinatorial Optimization Problems

    • Jianzhong Zhang
    • Zhongfan Ma

    OriginalPaper Pages: 127 - 139