| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
|
Gutiérrez, C.
|
|
2010
|
49 |
2 |
p. 313-342
|
artikel
|
| 2 |
A logarithmic-quadratic proximal point scalarization method for multiobjective programming
|
Gregório, Ronaldo
|
|
2010
|
49 |
2 |
p. 281-291
|
artikel
|
| 3 |
Characterizing strict efficiency for convex multiobjective programming problems
|
Gupta, Anjana
|
|
2010
|
49 |
2 |
p. 265-280
|
artikel
|
| 4 |
Comments on “Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine”
|
Tao, Jiping
|
|
2010
|
49 |
2 |
p. 359-362
|
artikel
|
| 5 |
Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
|
Nataraj, P. S. V.
|
|
2009
|
49 |
2 |
p. 185-212
|
artikel
|
| 6 |
Degree theory for a generalized set-valued variational inequality with an application in Banach spaces
|
Wang, Zhong Bao
|
|
2010
|
49 |
2 |
p. 343-357
|
artikel
|
| 7 |
Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem
|
Argyris, Nikolaos
|
|
2010
|
49 |
2 |
p. 213-235
|
artikel
|
| 8 |
Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
|
Zhang, Xinzhen
|
|
2010
|
49 |
2 |
p. 293-311
|
artikel
|
| 9 |
Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
|
Wen, Ching-Feng
|
|
2010
|
49 |
2 |
p. 237-263
|
artikel
|
Tijdschrift beschrijving