RAIRO - Operations Research - Recherche Opérationnelle, Volume 41 (2007) no. 1

Table of contents

Evaluating flexible solutions in single machine scheduling via objective function maximization : the study of computational complexity

Aloulou, Mohamed Ali; Kovalyov, Mikhail Y.; Portmann, Marie-Claude

p. 1-18

Limited memory solution of bound constrained convex quadratic problems arising in video games

Ferris, Michael C.; Wathen, Andrew J.; Armand, Paul

p. 19-34

Optimal times of price reductions for an inventory model with partial backorder and vertical shift demand

You, Peng-Sheng

p. 35-47

A numerical feasible interior point method for linear semidefinite programs

Benterki, Djamel; Crouzeix, Jean-Pierre; Merikhi, Bachir

p. 49-59

A discrete-time approximation technique for the time-cost trade-off in PERT networks

Azaron, Amir; Sakawa, Masatoshi; Tavakkoli-Moghaddam, Reza; Safaei, Nima

p. 61-81

Improved approximation of the general soft-capacitated facility location problem

Alfandari, Laurent

p. 83-93

1.0957 - Approximation algorithm for Random MAX-3SAT

Fernandez de La Vega, Wenceslas; Karpinski, Marek

p. 95-103

Convergence analysis of adaptive trust region methods

Shi, Zhen-Jun; Zhang, Xiang-Sun; Shen, Jie

p. 105-121