| 431 | -- | 474 | Xin Chen, Paul Tseng. Non-Interior continuation methods for solving semidefinite complementarity problems |
| 475 | -- | 491 | Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura. Primal separation for 0/1 polytopes |
| 493 | -- | 511 | Jitka Dupacová, Nicole Gröwe-Kuska, Werner Römisch. Scenario reduction in stochastic programming |
| 513 | -- | 532 | T. E. S. Raghavan, Zamir Syed. A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information |
| 533 | -- | 554 | Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.. On the maximum feasible subsystem problem, IISs and IIS-hypergraphs |
| 555 | -- | 571 | Andreas Griewank, Uwe Naumann. Accumulating Jacobians as chained sparse matrix products |
| 573 | -- | 616 | Javier M. Moguerza, Francisco J. Prieto. An augmented Lagrangian interior-point method using directions of negative curvature |
| 617 | -- | 630 | Klaus Jansen, Lorant Porkolab. Computing optimal preemptive schedules for parallel tasks: linear programming approaches |
| 631 | -- | 650 | A. F. Izmailov, Mikhail V. Solodov. Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods |