RAIRO - Operations Research
Volume 42 / No 2 (April-June 2008)
CIRO 05
Existence of solutions to weak nonlinear bilevel problems via MinSup and d.c. problems p. 87
Published online: 17 May 2008
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations p. 103
Published online: 17 May 2008
A logarithm barrier method for semi-definite programming p. 123
Published online: 17 May 2008
La différentiation automatique et son utilisation en optimisation p. 141
Published online: 17 May 2008
Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications p. 157
Published online: 17 May 2008
Generic Primal-dual Interior Point Methods Based on a New Kernel Function p. 199
Published online: 17 May 2008
New representation to reduce the search space for the resource-constrained project scheduling problem p. 215
Published online: 17 May 2008
Solution approaches to large shift scheduling problems p. 229
Published online: 17 May 2008