Volume 119, Number 1, June 2009

• 
  William W. Hager, Bernard A. Mair, Hongchao Zhang: An affine-scaling interior-point CBB method for box-constrained optimization. 1-32
• 
  Leah Epstein, Asaf Levin: A robust APTAS for the classical bin packing problem. 33-49
• 
  Kengy Barty, Jean-Sébastien Roy, Cyrille Strugarek: A stochastic gradient type algorithm for closed-loop problems. 51-78
• 
  Shoshana Anily, Michal Tzur, Laurence A. Wolsey: Multi-item lot-sizing with joint set-up costs. 79-94
• 
  Alexandre Belloni, Robert M. Freund: A geometric analysis of Renegar's condition number, and its interplay with conic curvature. 95-107
• 
  José R. Correa, Michael R. Wagner: LP-based online scheduling: from single to parallel machines. 109-136
• 
  Guoli Ding, Wenan Zang: Packing circuits in matroids. 137-168
• 
  François V. Louveaux, Juan José Salazar González: On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands. 169-194

Volume 119, Number 2, July 2009

• 
  Liqun Ban, Wen Song: Duality gap of the conic convex constrained optimization problems in normed spaces. 195-214
• 
  C. G. Liu, K. F. Ng, W. H. Yang: Merit functions in vector optimization. 215-237
• 
  Adam Ouorou: A proximal cutting plane method using Chebychev center for nonsmooth convex optimization. 239-271
• 
  Sunyoung Kim, Masakazu Kojima, Philippe L. Toint: Recognizing underlying sparsity in optimization. 273-303
• 
  Gyula Pap: Weighted restricted 2-matching. 305-329
• 
  Pierre Bonami, Gérard Cornuéjols, Andrea Lodi, François Margot: A Feasibility Pump for mixed integer nonlinear programs. 331-352
• 
  Ulrich Faigle, Satoru Fujishige: A general model for matroids and the greedy algorithm. 353-369
• 
  Huifu Xu, Dali Zhang: Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications. 371-401

last updated on Thu May 23 02:36:14 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page