- David S. Atkinson, Pravin M. Vaidya: A cutting plane algorithm for convex programming that uses analytic centers. 1-43 BibTeX
- O. Bahn, O. Du Merle, Jean-Louis Goffin, Jean-Philippe Vial: A cutting plane method from analytic centers for stochastic programming. 45-73 BibTeX
- Dick den Hertog, Florian Jarre, Kees Roos, Tamás Terlaky: A sufficient condition for self-concordance, with application to some classes of structured convex programming problems. 75-88 BibTeX
- Krzysztof C. Kiwiel: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. 89-109 BibTeX
- Claude Lemaréchal, Arkadii Nemirovskii, Yurii Nesterov: New variants of bundle methods. 111-147 BibTeX
- Yurii Nesterov: Complexity estimates of some cutting plane methods based on the analytic barrier. 149-176 BibTeX
- Yurii Nesterov, A. S. Nemirovskii: An interior-point method for generalized linear-fractional programming. 177-204 BibTeX
- Lieven Vandenberghe, Stephen P. Boyd: A primal-dual potential reduction method for problems involving matrix inequalities. 205-236 BibTeX
- Bintong Chen, Patrick T. Harker: A continuation method for monotone variational inequalities. 237-253 BibTeX
- Aniekan Ebiefung: Nonlinear mappings associated with the generalized linear complementarity problem. 255-268 BibTeX
- Dorit S. Hochbaum, Sung-Pil Hong: About strongly polynomial time algorithms for quadratic optimization over submodular constraints. 269-309 BibTeX
- Renato D. C. Monteiro, Stephen J. Wright: Superlinear primal-dual affine scaling algorithms for LCP. 311-333 BibTeX
- Michel X. Goemans: Worst-case comparison of valid inequalities for the TSP. 335-349 BibTeX
- Jianming Miao: A quadratically convergent O((k+1)root(n)L)-iteration algorithm for the P(k)-matrix linear complementarity problem. 355-368 BibTeX
- Sridhar Tayur, Rekha R. Thomas, N. R. Natraj: An algebraic geometry algorithm for scheduling in presence of setups and correlated demands. 369-401 BibTeX
- Jia-Ming Cao: Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs. 403-411 BibTeX
- Steef L. van de Velde: Dual decomposition of a single-machine scheduling problem. 413-428 BibTeX
- Mihir Bellare, Phillip Rogaway: The complexity of approximating a nonlinear program. 429-441 BibTeX
- Zelda B. Zabinsky, G. R. Wood, Mike A. Steel, William Baritompa: Pure adaptive search for finite global optimization. 443-448 BibTeX
- Alexander I. Barvinok: New algorithms for linear k-matroid intersection and matroid k-parity problems. 449-470 BibTeX
- Herbert Hamers, Peter Borm, Stef Tijs: On games corresponding to sequencing situations with ready times. 471-483 BibTeX