Volume 49, Number 1, January 2011

• 
  V. Jeyakumar, Guoyin Li: Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems. 1-14
• 
  S. Sadiq Basha: Best proximity points: global optimal approximate solutions. 15-21
• 
  S. K. Suneja, Seema Khurana, Meetu Bhatia: Optimality and duality in vector optimization involving generalized type I functions over cones. 23-35
• 
  Kequan Zhao, Xuewen Liu, Zhe Chen: A class of r-semipreinvex functions and optimality in nonlinear programming. 37-47
• 
  Georges K. Saharidis, Ioannis P. Androulakis, Marianthi G. Ierapetritou: Model building using bi-level optimization. 49-67
• 
  Chuan Lin, Anyong Qing, Quanyuan Feng: A new differential mutation base generator for differential evolution. 69-90
• 
  Lei-Hong Zhang, Li-Zhi Liao, Li-Ming Sun: Towards the global solution of the maximal correlation problem. 91-107
• 
  Xin-He Miao, Zheng-Hai Huang: The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces. 109-123
• 
  Suogang Gao, Zengti Li, Hongjie Du, Yan Shi, Weili Wu: Approaching pooling design with smaller efficient ratio. 125-135
• 
  Jiawei Chen, Yeol Je Cho, Jong Kyu Kim, Jun Li: Multiobjective optimization problems with modified objective functions and cone constraints and applications. 137-147
• 
  Weitao Sun, Yuan Dong: Study of multiscale global optimization based on parameter space partition. 149-172
• 
  M. D. Voisei, Constantin Zalinescu: Counterexamples to some triality and tri-duality results. 173-183

Volume 49, Number 2, February 2011

• 
  P. S. V. Nataraj, M. Arounassalame: Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm. 185-212
• 
  Nikolaos Argyris, José Rui Figueira, Alec Morton: Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem. 213-235
• 
  Ching-Feng Wen, Hsien-Chung Wu: Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems. 237-263
• 
  Anjana Gupta, Aparna Mehra, Davinder Bhatia: Characterizing strict efficiency for convex multiobjective programming problems. 265-280
• 
  Ronaldo Gregório, Paulo Roberto Oliveira: A logarithmic-quadratic proximal point scalarization method for multiobjective programming. 281-291
• 
  Xinzhen Zhang, Chen Ling, Liqun Qi: Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints. 293-311
• 
  César Gutiérrez, Bienvenido Jiménez, Vicente Novo: A generic approach to approximate efficiency and applications to vector optimization with set-valued maps. 313-342
• 
  Zhong Bao Wang, Nan-Jing Huang: Degree theory for a generalized set-valued variational inequality with an application in Banach spaces. 343-357
• 
  Jiping Tao, Zhijun Chao, Yugeng Xi: Comments on "Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine". 359-362

Volume 49, Number 3, March 2011

Special Issue: "Nonconvex Programming: Local and Global Pproaches - Theory, Algorithms and Applications" (NCP07)

• 
  Pham Dinh Tao, Le Thi Hoai An: Preface. 363-364
• 
  Boubakeur Benahmed, Hocine Mokhtar-Kharroubi, Bruno de Malafosse, Adnan Yassine: Quasi-Newton methods in infinite-dimensional spaces and application to matrix equations. 365-379
• 
  Phan Quoc Khanh, D. N. Quy: On generalized Ekeland's variational principle and equivalent formulations for set-valued mappings. 381-396
• 
  Alexei A. Gaivoronski, Abdel Lisser, Rafael Lopez, Hu Xu: Knapsack problem with probability constraints. 397-413
• 
  Soizic Adam, J. Frédéric Bonnans, Ruben Paraisy, Sébastien Veyrat: Application of convex lexicographical optimization to the balance of GRTgaz gas grid. 415-423
• 
  Mohamed Didi Biha, Marie-Jean Meurs: An exact algorithm for solving the vertex separator problem. 425-434
• 
  Marie Luong, Quoc Bao Do, Azeddine Beghdadi: A blind image watermarking using multiresolution visibility map. 435-448
• 
  Daniel Aloise, Pierre Hansen: Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering. 449-465
• 
  Charles Audet, Anthony Guillou, Pierre Hansen, Frédéric Messine, Sylvain Perron: The small hexagon and heptagon with maximum sum of distances between vertices. 467-480
• 
  Le Thi Hoai An, Pham Dinh Tao, Nguyen Dong Yen: Properties of two DC algorithms in quadratic programming. 481-495
• 
  Ralf Leidenberger, Karsten Urban: Automatic differentiation for the optimization of a ship propulsion and steering system: a proof of concept. 497-504
• 
  Jean-Paul Penot: The directional subdifferential of the difference of two convex functions. 505-519
• 
  Michel Minoux: On 2-stage robust LP with RHS uncertainty: complexity results and applications. 521-537

Volume 49, Number 4, April 2011

• 
  Shangyao Yan, Yu-Lin Shih, Wang-Tsang Lee: A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems. 539-559
• 
  Gang Xiao, Hong Xiao, Sanyang Liu: Scalarization and pointwise well-posedness in vector optimization problems. 561-574
• 
  I. V. Konnov, D. A. Dyabilkin: Nonmonotone equilibrium problems: coercivity conditions and weak regularization. 575-587
• 
  George Mavrotas, José Rui Figueira, Alexandros Antoniadis: Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems. 589-606
• 
  X. H. Gong: Chebyshev scalarization of solutions to the vector equilibrium problems. 607-622
• 
  Sanjay Mehrotra, Zhifeng Li: Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices. 623-649
• 
  Yongpei Guan: Stochastic lot-sizing with backlogging: computational complexity analysis. 651-678
• 
  Xiaolong Qin, Sun Young Cho, Shin Min Kang: An extragradient-type method for generalized equilibrium problems involving strictly pseudocontractive mappings. 679-693
• 
  Suhel Ahmad Khan: Generalized vector implicit quasi complementarity problems. 695-705
• 
  H. Mohebi, M. Vatandoost: Counterexamples on some articles on quasi-variational inclusion problems. 707-712
• 
  Nader Kanzi: Necessary optimality conditions for nonsmooth semi-infinite programming problems. 713-725