< previous issue
next issue >
Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models
Shragowitz, E.; Youssef, H.; Lu, B.
Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups
Kalir, A.A.; Sarin, S.C.
Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition
Patkar, S.B.; Narayanan, H.
The Enhanced Double Digest Problem for DNA Physical Mapping
Kao, M-Y.; Samet, J.; Sung, W-K.
Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian
Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem
Vasquez, M.; Hao, J-K.
Here are a few pages on the site that we think you may find useful: