1. Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models

   • Eugene Shragowitz
   • Habib Youssef
   • Bing Lu

   OriginalPaper Pages: 5 - 22

2. Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups

   • Adar A. Kalir
   • Subhash C. Sarin

   OriginalPaper Pages: 23 - 44

3. Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition

   • Sachin B. Patkar
   • H. Narayanan

   OriginalPaper Pages: 45 - 68

4. The Enhanced Double Digest Problem for DNA Physical Mapping

   • Ming-Yang Kao
   • Jared Samet
   • Wing-Kin Sung

   OriginalPaper Pages: 69 - 78

5. Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian

   • Chiuyuan Chen

   OriginalPaper Pages: 79 - 86

6. Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem

   • Michel Vasquez
   • Jin-Kao Hao

   OriginalPaper Pages: 87 - 103