1. Primal-dual first-order methods with \({\mathcal {O}(1/\epsilon)}\) iteration-complexity for cone programming

   • Guanghui Lan
   • Zhaosong Lu
   • Renato D. C. Monteiro

   FULL LENGTH PAPER 06 February 2009 Pages: 1 - 29

2. A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics

   • Khalid Addi
   • B. Brogliato
   • D. Goeleven

   Full Length Paper 18 February 2009 Pages: 31 - 67

3. A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems

   • Thomas C. Sharkey
   • H. Edwin Romeijn
   • Joseph Geunes

   FULL LENGTH PAPER 05 March 2009 Pages: 69 - 96

4. A polynomial oracle-time algorithm for convex integer minimization

   • Raymond Hemmecke
   • Shmuel Onn
   • Robert Weismantel

   FULL LENGTH PAPER 06 March 2009 Pages: 97 - 117

5. An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem

   • Luigi Grippo
   • Laura Palagi
   • Veronica Piccialli

   FULL LENGTH PAPER 10 March 2009 Pages: 119 - 146

6. Orbital branching

   • James Ostrowski
   • Jeff Linderoth
   • Stefano Smriglio

   FULL LENGTH PAPER 10 March 2009 Pages: 147 - 178

7. A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse

   • Ralf Gollmer
   • Uwe Gotzes
   • Rüdiger Schultz

   Full Length Paper 13 February 2009 Pages: 179 - 190

8. Erratum to: The capacitated max k-cut problem

   • Daya Ram Gaur
   • Ramesh Krishnamurti
   • Rajeev Kohli

   Erratum 18 September 2010 Pages: 191 - 191

9. A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set

   • Zhaosong Lu

   Short Communication 11 February 2009 Pages: 193 - 201