Journal: CEJOR

Volume 16, Issue 2

107 -- 109Oliver Stein, Georg Still, Tamás Terlaky, Gerhard-Wilhelm Weber. Editorial
111 -- 125Etienne de Klerk. The complexity of optimizing over a simplex, hypercube or sphere: a short survey
127 -- 138Ivo Nowak, Stefan Vigerske. LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs
139 -- 152Riccardo Cambini, Claudio Sodini. A computational comparison of some branch and bound methods for indefinite quadratic programs
153 -- 164Laura Carosi, Laura Martein. A sequential method for a class of pseudoconcave fractional problems
165 -- 178János D. Pintér. Model development and optimization in interactive computing environments
179 -- 189Ralf Werner. Cascading: an adjusted exchange method for robust conic programming
191 -- 203Laura Scrimali. The financial equilibrium problem with implicit budget constraints
205 -- 213Qinghong Zhang. Uniform LP duality for semidefinite and semi-infinite programming
215 -- 238Alireza Ghaffari Hadigheh, Habib Ghaffari Hadigheh, Tamás Terlaky. Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization