Locatelli Marco

Marco Locatelli

Information about the author Marco Locatelli will soon be added to the site.
Found 14 papers in total
Theoretical and computational results about optimality-based domain reductions
Theoretical and computational results about optimality-based domain reductions
2016
In this paper we discuss optimality‐based domain reductions for Global...
Global optimization based on local searches
Global optimization based on local searches
2016
In this paper we deal with the use of local searches within global optimization...
Global optimization based on local searches
Global optimization based on local searches
2013
In this paper we deal with the use of local searches within global optimization...
Branch and cut algorithms for detecting critical nodes in undirected graphs
Branch and cut algorithms for detecting critical nodes in undirected graphs
2012
In this paper we deal with the critical node problem, where a given number of nodes...
Approximation algorithm for a class of global optimization problems
Approximation algorithm for a class of global optimization problems
2013
In this paper we develop and derive the computational cost of an ϵ...
On the relation between concavity cuts and the surrogate dual for convex maximization problems
On the relation between concavity cuts and the surrogate dual for convex maximization problems
2012
In this note we establish a relation between two bounds for convex maximization...
Complexity of the critical node problem over trees
Complexity of the critical node problem over trees
2011
In this paper we deal with the critical node problem (CNP), i.e., the problem of...
A global optimization method for the design of space trajectories
A global optimization method for the design of space trajectories
2011
The problem of optimally designing a trajectory for a space mission is considered in...
Efficiently packing unequal disks in a circle
Efficiently packing unequal disks in a circle
2008
Placing non-overlapping circles in a smallest container is a hard task. In this paper...
Global optimization of Morse clusters by potential energy transformations
Global optimization of Morse clusters by potential energy transformations
2004
The Morse potential is a simple model for the potential energy of atoms with a single...
A ‘maximum node clustering’ problem
A ‘maximum node clustering’ problem
2006
In this note we introduce a graph problem, called Maximum Node Clustering (MNC). We...
The combinatorics of pivoting for the maximum weight clique
The combinatorics of pivoting for the maximum weight clique
2004
In this paper we prove the equivalence between pivoting-based heuristic (PBH) for the...
Undominated difference of convex decompositions of quadratic functions and applications to branch-and-bound approaches
Undominated difference of convex decompositions of quadratic functions and applications to branch-and-bound approaches
2004
In this paper we analyze difference-of-convex decompositions (d.c.d.s) for indefinite...
An adaptive stochastic global optimization algorithm for one-dimensional functions
An adaptive stochastic global optimization algorithm for one-dimensional functions
1995
In this paper a new algorithm is proposed, based upon the idea of modeling the...
Papers per page: