1. A second-order bundle method to minimize the maximum eigenvalue function

   • François Oustry

   Pages: 1 - 33

2. The mixed vertex packing problem

   • Alper Atamtürk
   • George L. Nemhauser
   • Martin W.P. Savelsbergh

   Pages: 35 - 53

3. Concavity and efficient points of discrete distributions in probabilistic programming

   • Darinka Dentcheva
   • András Prékopa
   • Andrzej Ruszczynski

   Pages: 55 - 77

4. Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization

   • Masakazu Kojima
   • Levent Tunçel

   Pages: 79 - 111

5. The packing property

   • Gérard Cornuéjols
   • Bertrand Guenin
   • François Margot

   Pages: 113 - 126

6. Strong inequalities for capacitated survivable network design problems

   • Daniel Bienstock
   • Gabriella Muratore

   Pages: 127 - 147

7. A trust region method based on interior point techniques for nonlinear programming

   • Richard H. Byrd
   • Jean Charles Gilbert
   • Jorge Nocedal

   Pages: 149 - 185

8. A generalized assignment problem with special ordered sets: a polyhedral approach

   • I.R. de Farias, Jr.
   • E.L. Johnson
   • G.L. Nemhauser

   Pages: 187 - 203