Tome 41 (2007) no. 1

Sommaire

Evaluating flexible solutions in single machine scheduling via objective function maximization : the study of computational complexity
p. 1-18
Limited memory solution of bound constrained convex quadratic problems arising in video games
p. 19-34
Optimal times of price reductions for an inventory model with partial backorder and vertical shift demand
p. 35-47
A numerical feasible interior point method for linear semidefinite programs
p. 49-59
A discrete-time approximation technique for the time-cost trade-off in PERT networks
p. 61-81
Improved approximation of the general soft-capacitated facility location problem
p. 83-93
1.0957 - Approximation algorithm for Random MAX-3SAT
p. 95-103
Convergence analysis of adaptive trust region methods
p. 105-121