Volume 43, Number 1, January 2009
Jan A. Snyman
, Schalk Kok
: A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization.
, Qin Wang
: Constrained inverse min-max spanning tree problems under the weighted Hamming distance.
: On G-invex multiobjective programming. Part I. Optimality.
: On G-invex multiobjective programming. Part II. Duality.
Volume 43, Numbers 2-3, March 2009 Mykonos Go conference
: Cutting circles and polygons from area-minimizing rectangles.
: Concave programming and DH-point.
Andrew Paul Smith
: Fast construction of constant bound functions for sparse polynomials.
Rubem P. Mondaini
: An analytical method for derivation of the Steiner Ratio of 3D euclidean Steiner trees.
Kurt M. Anstreicher
: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming.
Volume 43, Number 4, April 2009
: Game theoretical optimization inspired by information theory.
A. R. Doagooei
, Hossein Mohebi
: Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces.
: Nonsmooth multiobjective continuous-time problems with generalized invexity.