Finding good solutions to large scale, hard, global optimization problems, is a demanding task with many relevant applications. It is well known that, in order to tackle a difficult problem, an algorithm has to incorporate all of the available information on the problem domain. However, as we...

In this paper we develop and derive the computational cost of an <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\varepsilon}$$</EquationSource> </InlineEquation> -approximation algorithm for a class of global optimization problems, where a suitably defined composition of some ratio functions is minimized over a convex set. The result extends a previous one about a class...</equationsource></inlineequation>

In the recent paper (Locatelli and Schoen in Math Program, <CitationRef CitationID="CR11">2013</CitationRef>) it is shown that the value of the convex envelope of some bivariate functions over polytopes can be computed by solving a continuously differentiable convex problem. In this paper we show how this result can be exploited to derive...</citationref>

In this paper we deal with the critical node problem, where a given number of nodes has to be removed from an undirected graph in order to maximize the disconnections between the node pairs of the graph. We propose an integer linear programming model with a non-polynomial number of constraints...