Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm P. S. V. NatarajM. Arounassalame OriginalPaper 10 November 2009 Pages: 185 - 212
Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem Nikolaos ArgyrisJosé Rui FigueiraAlec Morton OriginalPaper 17 March 2010 Pages: 213 - 235
Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems Ching-Feng WenHsien-Chung Wu OriginalPaper 23 March 2010 Pages: 237 - 263
Characterizing strict efficiency for convex multiobjective programming problems Anjana GuptaAparna MehraDavinder Bhatia OriginalPaper 24 March 2010 Pages: 265 - 280
A logarithmic-quadratic proximal point scalarization method for multiobjective programming Ronaldo GregórioPaulo Roberto Oliveira OriginalPaper 01 April 2010 Pages: 281 - 291
Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints Xinzhen ZhangChen LingLiqun Qi OriginalPaper 08 April 2010 Pages: 293 - 311
A generic approach to approximate efficiency and applications to vector optimization with set-valued maps C. GutiérrezB. JiménezV. Novo OriginalPaper 04 April 2010 Pages: 313 - 342
Degree theory for a generalized set-valued variational inequality with an application in Banach spaces Zhong Bao WangNan Jing Huang OriginalPaper 08 April 2010 Pages: 343 - 357
Comments on “Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine” Jiping TaoZhijun ChaoYugeng Xi OriginalPaper 21 April 2010 Pages: 359 - 362