1. Note on the computational complexity ofj-radii of polytopes in ℝ ⁿ

   • U. Faigle
   • W. Kern
   • M. Streng

   OriginalPaper Pages: 1 - 5

2. Extended formulations for the A-cut problem

   • Sunil Chopra
   • Jonathan H. Owen

   OriginalPaper Pages: 7 - 30

3. On the partial order polytope of a digraph

   • Rudolf Müller

   OriginalPaper Pages: 31 - 49

   

4. A quasi-second-order proximal bundle algorithm

   • Robert Mifflin

   OriginalPaper Pages: 51 - 72

5. Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization

   • A. R. Conn
   • Nick Gould
   • Ph. L. Toint

   OriginalPaper Pages: 73 - 110

6. Speeding up Karmarkar's algorithm for multicommodity flows

   • Sanjiv Kapoor
   • Pravin M. Vaidya

   OriginalPaper Pages: 111 - 127