You have Guest access.
Log In
Volume 14 / 2006 - Volume 20 / 2012
107-109
Editorial
Oliver Stein, Georg Still, Tamás Terlaky and Gerhard-Wilhelm Weber
111-125
Original Paper
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Etienne de Klerk
127-138
LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs
Ivo Nowak and Stefan Vigerske
139-152
A computational comparison of some branch and bound methods for indefinite quadratic programs
Riccardo Cambini and Claudio Sodini
153-164
A sequential method for a class of pseudoconcave fractional problems
Laura Carosi and Laura Martein
165-178
Model development and optimization in interactive computing environments
János D. Pintér
179-189
Cascading: an adjusted exchange method for robust conic programming
Ralf Werner
191-203
The financial equilibrium problem with implicit budget constraints
Laura Scrimali
205-213
Uniform LP duality for semidefinite and semi-infinite programming
Qinghong Zhang
215-238
Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization
Alireza Ghaffari-Hadigheh, Habib Ghaffari-Hadigheh and Tamás Terlaky
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info