1. Sparse quasi-Newton updates with positive definite matrix completion

   • Nobuo Yamashita

   FULL LENGTH PAPER 19 June 2007 Pages: 1 - 30

2. New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability

   • Immanuel M. Bomze
   • Marco Locatelli
   • Fabio Tardella

   FULL LENGTH PAPER 16 June 2007 Pages: 31 - 64

3. The capacitated max k-cut problem

   • Daya Ram Gaur
   • Ramesh Krishnamurti
   • Rajeev Kohli

   FULL LENGTH PAPER 14 June 2007 Pages: 65 - 72

4. The mixing-MIR set with divisible capacities

   • M. Zhao
   • I. R. de Farias Jr

   FULL LENGTH PAPER 20 June 2007 Pages: 73 - 103

5. A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms

   • Renato D. C. Monteiro
   • Takashi Tsuchiya

   FULL LENGTH PAPER 16 June 2007 Pages: 105 - 149

6. A simplex based algorithm to solve separated continuous linear programs

   • Gideon Weiss

   FULL LENGTH PAPER 17 April 2008 Pages: 151 - 198