1. On Split-Coloring Problems

   • T. Ekim
   • D. de Werra

   OriginalPaper Pages: 211 - 225

2. Efficient Solutions for Special Zero-One Programming Problems

   • Ariela Bilitzky
   • Arik Sadeh

   OriginalPaper Pages: 227 - 238

3. Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem

   • Mhand Hifi
   • Hedi Mhalla
   • Slim Sadfi

   OriginalPaper Pages: 239 - 260

4. Testing Systems of Identical Components

   • Tonguç Ünlüyurt

   OriginalPaper Pages: 261 - 282

5. Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree

   • Michael A. Henning
   • Michael D. Plummer

   OriginalPaper Pages: 283 - 294