| 281 | -- | 288 | A. Brown, A. Gedlaman, A. Holder, S. Martinez. An extension of the fundamental theorem of linear programming |
| 289 | -- | 294 | Earl Barnes, Victoria Chen, Balaji Gopalakrishnan, Ellis L. Johnson. A least-squares primal-dual algorithm for solving linear programming problems |
| 295 | -- | 307 | Jerzy A. Filar, Eitan Altman, Konstantin Avrachenkov. An asymptotic simplex method for singularly perturbed linear programs |
| 308 | -- | 318 | Vidyadhar G. Kulkarni, Elena I. Tzenova. Mean first passage times in fluid queues |
| 319 | -- | 326 | Michael Sherman, David Goldsman. Large-sample normality of the batch-means variance estimator |
| 327 | -- | 332 | Alexander A. Ageev. Improved approximation algorithms for multilevel facility location problems |
| 333 | -- | 335 | Jiawei Zhang, Yinyu Ye. A note on the maximization version of the multi-level facility location problem |
| 336 | -- | 342 | Alain Billionnet. Approximation algorithms for fractional knapsack problems |
| 343 | -- | 350 | Yongpei Guan, Wen-Qiang Xiao, Raymond K. Cheung, Chung-Lun Li. A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis |