| 103 | -- | 111 | Michael F. Argüello, Thomas A. Feo, Olivier Goldschmidt. Randomized methods for the number partitioning problem |
| 113 | -- | 119 | Mehrdad Tamiz, Simon J. Mardle, Dylan F. Jones. Detecting iis in infeasible linear programmes using techniques from goal programming |
| 121 | -- | 129 | Laura Burke. Conscientious neural nets for tour construction in the traveling salesman problem: the vigilant net |
| 131 | -- | 140 | Susan A. Slotnick, Thomas E. Morton. Selecting jobs for a heavily loaded shop with lateness penalties |
| 141 | -- | 152 | Hussein M. Saber, A. Ravindran. A Partitioning Gradient Based (PGB) algorithm for solving nonlinear goal programming problems |
| 153 | -- | 170 | Houn-Gee Chen, Diptendu Sinha. An inventory decision support system using the object-oriented approach |
| 171 | -- | 182 | Timothy D. Fry, Ronald D. Armstrong, Ken Darby-Dowman, Patrick R. Philipoom. A branch and bound procedure to minimize mean absolute lateness on a single processor |
| 183 | -- | 192 | Kyösti Tarvainen. An elimination condition to check the validity of the principle of optimality |
| 193 | -- | 198 | Fatin Sezgin. A random number generator for 16-bit microcomputers |
| 199 | -- | 205 | Wlodzimierz Ogryczak. A note on modeling multiple choice requirements for simple mixed integer programming solvers |