91 | -- | 96 | T. C. Edwin Cheng. Optimal common due-date with limited completion time deviation |
97 | -- | 102 | Sang M. Lee, Richard L. Luebbe. A comparison of a constraint aggregation and partitioning zero-one goal programming algorithm with the lee and Morris algorithm |
103 | -- | 113 | Rex K. Kincaid, Timothy J. Lowe, Thomas L. Morin. The location of central structures in trees |
115 | -- | 121 | Francis J. Vasko, Floyd E. Wolf. Solving large set covering problems on a personal computer |
123 | -- | 134 | Jacob W. Ulvila, Bryan B. Thompson. A computerized risk analysis aid |
135 | -- | 144 | Wade D. Cook, Igal Golan, Moshe Kress. Heuristics for ranking players in a round robin tournament |
145 | -- | 155 | Mufit Ozden. A solution procedure for general knapsack problems with a few constraints |
157 | -- | 169 | Laoucine Kerbache, J. MacGregor Smith. Asymptotic behavior of the expansion method for open finite queueing networks |
171 | -- | 177 | Nicholas G. Hall, Soumen Ghosh, Roland D. Kankey, Sridhar Narasimhan, Wansoo T. Rhee. Bin packing problems in one dimension: Heuristic solutions and confidence intervals |
179 | -- | 188 | R. K. Arora, R. K. Sachdeva. Distributed simulation of activity networks |
189 | -- | 198 | Rasaratnam Logendran, M. Palmer Terrell. Uncapacitated plant location-allocation problems with price sensitive stochastic demands |