1. Benchmarking optimization software with performance profiles

   • Elizabeth D. Dolan
   • Jorge J. Moré

   Pages: 201 - 213

2. Fast and simple approximation schemes for generalized flow

   • Lisa K. Fleischer
   • Kevin D. Wayne

   Pages: 215 - 238

3. Nonlinear programming without a penalty function

   • Roger Fletcher
   • Sven Leyffer

   Pages: 239 - 269

4. A polynomial dual simplex algorithm for the generalized circulation problem

   • Donald Goldfarb
   • Zhiying Jin
   • Yiqing Lin

   Pages: 271 - 288

5. Wedge trust region methods for derivative free optimization

   • Marcelo Marazzi
   • Jorge Nocedal

   Pages: 289 - 305

6. A branch and cut approach to the cardinality constrained circuit problem

   • P. Bauer
   • J.T. Linderoth
   • M.W.P. Savelsbergh

   Pages: 307 - 348

7. On convergence of the Gauss-Newton method for convex composite optimization

   • Chong Li
   • Xinghua Wang

   Pages: 349 - 356

8. Minimizing the span of d-walks to compute optimum frequency assignments

   • Alessandro Avenali
   • Carlo Mannino
   • Antonio Sassano

   Pages: 357 - 374

9. A characterization of ill-posed data instances for convex programming

   • Manuel A. Nunez

   Pages: 375 - 390

10. On the rank of mixed 0,1 polyhedra

    • Gérard Cornuéjols
    • Yanjun Li

    Pages: 391 - 397