1. A PTAS for Semiconductor Burn-in Scheduling

   • Xiaotie Deng
   • Haodi Feng
   • Benyun Shi

   OriginalPaper Pages: 5 - 17

2. Average-Case Performance Analysis of a 2D Strip Packing Algorithm—NFDH

   • Xiaodong Gu
   • Guoliang Chen
   • Yinlong Xu

   OriginalPaper Pages: 19 - 34

3. Requiring Connectivity in the Set Covering Problem

   • J. Orestes Cerdeira
   • Leonor S. Pinto

   OriginalPaper Pages: 35 - 47

4. Scheduling in Switching Networks with Set-Up Delays

   • Foto Afrati
   • Timos Aslanidis
   • Ioannis Milis

   OriginalPaper Pages: 49 - 57

5. Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation

   • Jon Lee
   • Janny Leung
   • Sven de Vries

   OriginalPaper Pages: 59 - 67

6. Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications

   • Danny Z. Chen
   • Ovidiu Daescu
   • Jinhui Xu

   OriginalPaper Pages: 69 - 90

7. Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance

   • Yong He
   • Binwu Zhang
   • Enyu Yao

   OriginalPaper Pages: 91 - 100

8. Two Variations of the Minimum Steiner Problem

   • Tsan-Sheng Hsu
   • Kuo-Hui Tsai
   • D. T. Lee

   OriginalPaper Pages: 101 - 120

9. Order Consolidation for Batch Processing

   • Hark-Chin Hwang
   • Soo Y. Chang

   OriginalPaper Pages: 121 - 138