Comparing, or benchmarking, of optimization algorithms is a complicated task that involves
many subtle considerations to yield a fair and unbiased evaluation. In this paper, we …

In science, engineering and economics, decision problems are frequently modelled by
optimizing the value of a (primary) objective function under stated feasibility constraints. In …

A branch and bound global optimization method, α BB, for general continuous optimization
problems involving nonconvexities in the objective function and/or constraints is presented …

The first systematic overviews on global optimization appeared in 1975–1978 thanks to two
fundamental volumes titled Towards Global Optimization (Dixon & Szegö, 1975, 1978). At …

A large number of nonlinear optimization problems involve bilinear, quadratic and/or
polynomial functions in their objective function and/or constraints. In this paper, a theoretical …

Recent advances in global optimization for process synthesis, design and control are
discussed. After a review of the chemical engineering contributions, we focus on the …

Following from part I, which presents a retrospective on optimization, we focus here on areas
that are recent active research topics and are likely to strongly influence the future of …

En este artículo se hace una revisión de las técnicas de optimización más importantes:
programación lineal y no lineal con y sin variables discretas, así como de los algoritmos …

Lipschitz optimization solves global optimization problems in which the objective function
and constraint left-hand sides may be given by oracles (or explicitly) and have a bounded …

Continuous covering location problems Page 1 Continuous covering location problems ∗
Frank Plastria GOLD - Research Group on Location and Distribution Department of …