1. Reducing the number of variables in Integer and Linear Programming Problems

   • Djangir A. Babayev
   • Sahib S. Mardanov

   OriginalPaper Pages: 99 - 109

2. Solving binary cutting stock problems by column generation and branch-and-bound

   • Pamela H. Vance
   • Cynthia Barnhart
   • George L. Nemhauser

   OriginalPaper Pages: 111 - 130

3. Local convergence of interior-point algorithms for degenerate monotone LCP

   • Renato D. C. Monteiro
   • Stephen J. Wright

   OriginalPaper Pages: 131 - 155

4. A parameterized Newton method and a quasi-Newton method for nonsmooth equations

   • Xiaojun Chen
   • Liqun Qi

   OriginalPaper Pages: 157 - 179

5. Calculating a minimal sphere containing a polytope defined by a system of linear inequalities

   • Hiroshi Konno
   • Yasutoshi Yajima
   • Ayumi Ban

   OriginalPaper Pages: 181 - 191