| 1 | -- | 14 | Irvin J. Lustig, Roy E. Marsten, David F. Shanno. Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art |
| 15 | -- | 22 | Robert E. Bixby. Commentary - Progress in Linear Programming |
| 23 | -- | 27 | Michael A. Saunders. Commentary - Major Cholesky Would Feel Proud |
| 28 | -- | 31 | Michael J. Todd. Commentary - Theory and Practice for Interior-Point Methods |
| 32 | -- | 34 | Robert J. Vanderbei. Commentary - Interior-Point Methods: Algorithms and Formulations |
| 35 | -- | 36 | Irvin J. Lustig, Roy E. Marsten, David F. Shanno. Rejoinder - The Last Word on Interior Point Methods for Linear Programming - For Now |
| 37 | -- | 49 | Vincent Dugat, Sandra Sandri. Complexity of Hierarchical Trees in Evidence Theory |
| 50 | -- | 60 | Hasan Pirkul, Sridhar Narasimhan. Primary and Secondary Route Selection in Backbone Computer Networks |
| 61 | -- | 67 | Rajiv M. Dewan. Design of Performance Constrained Optic Fiber Multidrop Access Networks |
| 68 | -- | 81 | Joseph F. Pekny, Donald L. Miller. A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph |
| 82 | -- | 93 | Ronny Aboudi, Kurt Jörnsten. Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic |
| 94 | -- | 105 | Ho-Won Jung, Roy E. Marsten, Matthew J. Saltzman. Numerical Factorization Methods for Interior Point Algorithms |