Tome 42 (2008) no. 2

Sommaire

Éditorial
p. 85
Existence of solutions to weak nonlinear bilevel problems via MinSup and d.c. problems
p. 87-103
Quadratic 0-1 programming : tightening linear or quadratic convex reformulation by use of relaxations
p. 103-121
A logarithm barrier method for semi-definite programming
p. 123-139
La différentiation automatique et son utilisation en optimisation
p. 141-155
Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications
p. 157-198
Generic primal-dual interior point methods based on a new kernel function
p. 199-213
New representation to reduce the search space for the resource-constrained project scheduling problem
p. 215-228
Solution approaches to large shift scheduling problems
p. 229-258