1. The C ³ Theorem and a D ² Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification

   • Suvrajeet Sen
   • Julia L. Higle

   OriginalPaper 28 April 2005 Pages: 1 - 20

2. An asymptotically exact algorithm for the high-multiplicity bin packing problem

   • Carlo Filippi
   • Alessandro Agnetis

   OriginalPaper 09 February 2005 Pages: 21 - 37

3. Interior projection-like methods for monotone variational inequalities

   • Alfred Auslender
   • Marc Teboulle

   OriginalPaper 09 February 2005 Pages: 39 - 68

4. The Fermat rule for multifunctions on Banach spaces

   • Xi Yin Zheng
   • Kung Fu Ng

   OriginalPaper 09 February 2005 Pages: 69 - 90

5. The feasibility pump

   • Matteo Fischetti
   • Fred Glover
   • Andrea Lodi

   OriginalPaper 14 March 2005 Pages: 91 - 104

6. On a primal-proximal heuristic in discrete optimization

   • A. Daniilidis
   • C. Lemaréchal

   OriginalPaper 14 March 2005 Pages: 105 - 128

7. A primal-proximal heuristic applied to the French Unit-commitment problem

   • L. Dubost
   • R. Gonzalez
   • C. Lemaréchal

   OriginalPaper 28 April 2005 Pages: 129 - 151

8. A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming

   • Arjan Berkelaar
   • Joaquim A. S. Gromicho
   • Shuzhong Zhang

   OriginalPaper 24 February 2005 Pages: 153 - 177

9. Cuts for mixed 0-1 conic programming

   • M.T. Çezik
   • G. Iyengar

   OriginalPaper 28 April 2005 Pages: 179 - 202