The branch-and-bound (B&B) algorithmic framework has been used successfully to find
exact solutions for a wide array of optimization problems. B&B uses a tree search strategy to …

The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization centered around the constraint integer programming framework SCIP. This …

This chapter surveys how semidefinite programming can be used for finding good
approximative solutions to hard combinatorial optimization problems. The chapter begins …

This is the first comprehensive introduction to the powerful moment approach for solving
global optimization problems (and some related problems) described by polynomials (and …

Many important applications in global optimization, algebra, probability and statistics,
applied mathematics, control theory, financial mathematics, inverse problems, etc. can be …

Optimization has been expanding in all directions at an astonishing rate during the last few
decades. New algorithmic and theoretical techniques have been developed, the diffusion …

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

This paper is concerned with the development of an algorithm for general bilinear
programming problems. Such problems find numerous applications in economics and game …

We present a model for the optimization of a global supply that maximizes the after tax profits
of a multinational corporation and that includes transfer prices and the allocation of …

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 …