1. Logical Constraints as Cardinality Rules: Tight Representation

   • Egon Balas

   OriginalPaper Pages: 115 - 128

2. On Approximability of Boolean Formula Minimization

   • Oleg A. Prokopyev
   • Panos M. Pardalos

   OriginalPaper Pages: 129 - 135

3. Batch-Processing Scheduling with Setup Times

   • Chuangyin Dang
   • Liying Kang

   OriginalPaper Pages: 137 - 146

4. Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration

   • Karen Aardal

   OriginalPaper Pages: 147 - 149

5. b-Tree Facets for the Simple Graph Partitioning Polytope

   • Michael M. Sørensen

   OriginalPaper Pages: 151 - 170

6. Wide Diameters of Cartesian Product Graphs and Digraphs

   • Jun-Ming Xu

   OriginalPaper Pages: 171 - 181

7. A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition

   • Guohui Lin
   • Tao Jiang

   OriginalPaper Pages: 183 - 194

8. A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems

   • Antonio Frangioni
   • Emiliano Necciari
   • Maria Grazia Scutellà

   OriginalPaper Pages: 195 - 220