The C 3 Theorem and a D 2 Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification Suvrajeet SenJulia L. Higle OriginalPaper 28 April 2005 Pages: 1 - 20
An asymptotically exact algorithm for the high-multiplicity bin packing problem Carlo FilippiAlessandro Agnetis OriginalPaper 09 February 2005 Pages: 21 - 37
Interior projection-like methods for monotone variational inequalities Alfred AuslenderMarc Teboulle OriginalPaper 09 February 2005 Pages: 39 - 68
The Fermat rule for multifunctions on Banach spaces Xi Yin ZhengKung Fu Ng OriginalPaper 09 February 2005 Pages: 69 - 90
The feasibility pump Matteo FischettiFred GloverAndrea Lodi OriginalPaper 14 March 2005 Pages: 91 - 104
On a primal-proximal heuristic in discrete optimization A. DaniilidisC. Lemaréchal OriginalPaper 14 March 2005 Pages: 105 - 128
A primal-proximal heuristic applied to the French Unit-commitment problem L. DubostR. GonzalezC. Lemaréchal OriginalPaper 28 April 2005 Pages: 129 - 151
A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming Arjan BerkelaarJoaquim A. S. GromichoShuzhong Zhang OriginalPaper 24 February 2005 Pages: 153 - 177
Cuts for mixed 0-1 conic programming M.T. ÇezikG. Iyengar OriginalPaper 28 April 2005 Pages: 179 - 202