| 669 | -- | 687 | Alfred Auslender, Roberto Cominetti, Jean-Pierre Crouziex. Convex Functions with Unbounded Level Sets and Applications to Duality Theory |
| 688 | -- | 695 | Francisco Barahona. Reducing Matching to Polynomial Size Linear Programming |
| 696 | -- | 725 | Tamra J. Carpenter, Irvin J. Lustig, John M. Mulvey, David F. Shanno. Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives |
| 726 | -- | 733 | Yasufumi Saruwatari, Tomomi Matsui. K-Best Solutions to the Chinese Postman Problem |
| 734 | -- | 750 | E. Andrew Boyd. Generating Fenchel Cutting Planes for Knapsack Polyhedra |
| 751 | -- | 783 | Ciyou Zhu, R. Tyrrell Rockafellar. Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming |
| 784 | -- | 799 | Chuangyin Dang. *-Triangulation for Continuous Deformation Algorithms to Compute Solutions of Nonlinear Equations |
| 800 | -- | 825 | J. E. Martínez-Legaz, S. Romano-Rodríguez. α-Lower Subdifferentiable Functions |
| 826 | -- | 842 | Immanuel M. Bomze, Gabriele Danninger. A Global Optimization Algorithm for Concave Quadratic Programming Problems |
| 843 | -- | 860 | Florian A. Potra, Yinyu Ye. A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems |
| 861 | -- | 867 | Robert A. Bosch. On Mizuno's Rank-One Updating Algorithm for Linear Programming |
| 868 | -- | 881 | Bernard Delyon, Anatoli Juditsky. Accelerated Stochastic Approximation |
| 882 | -- | 900 | Ubaldo Garco. Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem |
| 901 | -- | 918 | Kenneth O. Kortanek, Hoon No. A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems |