The complexity of optimizing over a simplex, hypercube or sphere: a short survey Etienne de Klerk Original Paper Open access 18 December 2007 Pages: 111 - 125
LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs Ivo NowakStefan Vigerske Original Paper 18 December 2007 Pages: 127 - 138
A computational comparison of some branch and bound methods for indefinite quadratic programs Riccardo CambiniClaudio Sodini Original Paper 18 December 2007 Pages: 139 - 152
A sequential method for a class of pseudoconcave fractional problems Laura CarosiLaura Martein Original Paper 18 December 2007 Pages: 153 - 164
Model development and optimization in interactive computing environments János D. Pintér Original Paper 26 March 2008 Pages: 165 - 178
Cascading: an adjusted exchange method for robust conic programming Ralf Werner Original Paper 18 December 2007 Pages: 179 - 189
The financial equilibrium problem with implicit budget constraints Laura Scrimali Original Paper 18 December 2007 Pages: 191 - 203
Uniform LP duality for semidefinite and semi-infinite programming Qinghong Zhang Original Paper 18 December 2007 Pages: 205 - 213
Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization Alireza Ghaffari-HadighehHabib Ghaffari-HadighehTamás Terlaky Original Paper 04 January 2008 Pages: 215 - 238