Operations Research

Vol. 41 No. 1 (January-March 2007)

• Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity     p. 1
  Mohamed Ali Aloulou, Mikhail Y. Kovalyov and Marie-Claude Portmann
  Abstract | PDF file (246.6 KB) | References



• Limited memory solution of bound constrained convex quadratic problems arising in video games     p. 19
  Michael C. Ferris, Andrew J. Wathen and Paul Armand
  Abstract | PDF file (213.8 KB) | References



• Optimal times of price reductions for an inventory model with partial backorder and vertical shift demand     p. 35
  Peng-Sheng You
  Abstract | PDF file (162.7 KB) | References



• A numerical feasible interior point method for linear semidefinite programs     p. 49
  Djamel Benterki, Jean-Pierre Crouzeix and Bachir Merikhi
  Abstract | PDF file (139.7 KB) | References



• A discrete-time approximation technique for the time-cost trade-off in PERT networks     p. 61
  Amir Azaron, Masatoshi Sakawa, Reza Tavakkoli-Moghaddam and Nima Safaei
  Abstract | PDF file (516.2 KB) | References



• Improved approximation of the general soft-capacitated facility location problem     p. 83
  Laurent Alfandari
  Abstract | PDF file (164.5 KB) | References



• 1.0957-Approximation Algorithm for Random MAX-3SAT     p. 95
  Wenceslas Fernandez de la Vega and Marek Karpinski
  Abstract | PDF file (145.3 KB) | References



• Convergence analysis of adaptive trust region methods     p. 105
  Zhen-Jun Shi, Xiang-Sun Zhang and Jie Shen
  Abstract | PDF file (190.3 KB) | References