Liberti Leo

Leo Liberti

Information about the author Leo Liberti will soon be added to the site.
Found 20 papers in total
Surrogate-based methods for black-box optimization
Surrogate-based methods for black-box optimization
2017
In this paper, we survey methods that are currently used in black‐box...
The power edge set problem
The power edge set problem
2016
The automated real time control of an electrical network is achieved through the...
Six mathematical gems from the history of distance geometry
Six mathematical gems from the history of distance geometry
2016
This is a partial account of the fascinating history of distance geometry. We make no...
Optimization and sustainable development
Optimization and sustainable development
2015
In this opinion paper, I argue that ‘optimization and sustainable...
The interval Branch‐and‐Prune algorithm for the discretizable molecular distance geometry problem with inexact distances
The interval Branch‐and‐Prune algorithm for the discretizable molecular distance geometry problem with inexact distances
2013
The Distance Geometry Problem in three dimensions consists in finding an embedding in...
The Anonymous Subgraph Problem
The Anonymous Subgraph Problem
2013
In this work we address the Anonymous Subgraph Problem (ASP). The problem asks to...
A matroid view of key theorems for edge‐swapping algorithms
A matroid view of key theorems for edge‐swapping algorithms
2012
We demonstrate that two key theorems of Amaldi et al. (2009), which they presented...
Discretization orders for distance geometry problems
Discretization orders for distance geometry problems
2012
Given a weighted, undirected simple graph G = ( V , E , d ) (where d : E → ℝ...
Reduced RLT representations for nonconvex polynomial programming problems
Reduced RLT representations for nonconvex polynomial programming problems
2012
This paper explores equivalent, reduced size Reformulation‐Linearization...
Recent advances on the Discretizable Molecular Distance Geometry Problem
Recent advances on the Discretizable Molecular Distance Geometry Problem
2012
The Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in...
Edge cover by connected bipartite subgraphs
Edge cover by connected bipartite subgraphs
2011
We consider the problem of covering the edge set of an unweighted, undirected graph...
Fast paths in large-scale dynamic road networks
Fast paths in large-scale dynamic road networks
2010
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic...
Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem
Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem
2009
We use reformulation techniques to model and solve a complex sphere covering problem...
Reformulations in Mathematical Programming: Definitions and Systematics
Reformulations in Mathematical Programming: Definitions and Systematics
2009
A reformulation of a mathematical program is a formulation which shares some...
Spherical cuts for integer programming problems
Spherical cuts for integer programming problems
2008
We introduce a new family of valid inequalities for general linear integer programming...
A branch-and-prune algorithm for the molecular distance geometry problem
A branch-and-prune algorithm for the molecular distance geometry problem
2008
The Molecular Distance Geometry Problem consists in finding the positions in R 3 of...
Comparison of deterministic and stochastic approaches to global optimization
Comparison of deterministic and stochastic approaches to global optimization
2005
In this paper, we compare two different approaches to nonconvex global optimization....
Linearity embedded in nonconvex programs
Linearity embedded in nonconvex programs
2005
Nonconvex programs involving bilinear terms and linear equality constraints often...
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
2005
The problem of finding a fundamental cycle basis with minimum total cost in a graph...
Reduction constraints for the global optimization of nonlinear problems
Reduction constraints for the global optimization of nonlinear problems
2004
Convergence of branch-and-bound algorithms for the solution of NLPs is obtained by...
Papers per page: