Sparse quasi-Newton updates with positive definite matrix completion Nobuo Yamashita FULL LENGTH PAPER 19 June 2007 Pages: 1 - 30
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability Immanuel M. BomzeMarco LocatelliFabio Tardella FULL LENGTH PAPER 16 June 2007 Pages: 31 - 64
The capacitated max k-cut problem Daya Ram GaurRamesh KrishnamurtiRajeev Kohli FULL LENGTH PAPER 14 June 2007 Pages: 65 - 72
The mixing-MIR set with divisible capacities M. ZhaoI. R. de Farias Jr FULL LENGTH PAPER 20 June 2007 Pages: 73 - 103
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. MonteiroTakashi Tsuchiya FULL LENGTH PAPER 16 June 2007 Pages: 105 - 149
A simplex based algorithm to solve separated continuous linear programs Gideon Weiss FULL LENGTH PAPER 17 April 2008 Pages: 151 - 198