1. Robust solutions of Linear Programming problems contaminated with uncertain data

   • Aharon Ben-Tal
   • Arkadi Nemirovski

   Pages: 411 - 424

2. Set packing relaxations of some integer programs

   • Ralf Borndörfer
   • Robert Weismantel

   Pages: 425 - 450

3. Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system

   • Marina Epelman
   • Robert M. Freund

   Pages: 451 - 485

4. Modeling languages and Condor: metacomputing for optimization

   • Michael C. Ferris
   • Todd S. Munson

   Pages: 487 - 505

5. A fast algorithm for computing minimum 3-way and 4-way cuts

   • Hiroshi Nagamochi
   • Toshihide Ibaraki

   Pages: 507 - 520

6. Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities

   • Jean-Pierre Crouzeix
   • Patrice Marcotte
   • Daoli Zhu

   Pages: 521 - 539

7. Computing the nucleolus of some combinatorially-structured games

   • Jeroen Kuipers
   • Tamás Solymosi
   • Harry Aarts

   Pages: 541 - 563

8. Failure of global convergence for a class of interior point methods for nonlinear programming

   • Andreas Wächter
   • Lorenz T. Biegler

   Pages: 565 - 574

9. On semidefinite linear complementarity problems

   • M. Seetharama Gowda
   • Yoon Song

   Pages: 575 - 587