• Publications
  • Influence
Branching and bounds tighteningtechniques for non-convex MINLP
TLDR
We study the impact of two important parts of sBB methods: bounds tightening (BT) and branching strategies. Expand
  • 509
  • 54
  • PDF
Introduction to Global Optimization
TLDR
This paper is a mini-course about global optimization techniques in nonconvex programming; it deals with some theoretical aspects of nonlinear programming as well as with the current stateof-the-art algorithms in global optimization. Expand
  • 282
  • 24
  • PDF
ALICE Technical Design Report of the Inner Tracking System (ITS)
  • 50
  • 13
Euclidean Distance Geometry and Applications
TLDR
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. Expand
  • 242
  • 11
  • PDF
The discretizable molecular distance geometry problem
TLDR
We show that under a few assumptions usually satisfied in proteins, the Molecular Distance Geometry Problem (MDGP) can be formulated as a search in a discrete space. Expand
  • 113
  • 7
  • PDF
Column generation algorithms for exact modularity maximization in networks.
Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Girvan [Phys. Rev. E 69, 026113 (2004)], isExpand
  • 100
  • 7
  • PDF
Bidirectional A* Search for Time-Dependent Fast Paths
TLDR
The computation of point-to-point shortest paths on time-dependent road networks has many practical applications, but there have been very few works that propose efficient algorithms for large graphs. Expand
  • 96
  • 7
  • PDF
Reformulations in mathematical programming: automatic symmetry detection and exploitation
  • Leo Liberti
  • Mathematics, Computer Science
  • Math. Program.
  • 1 February 2012
TLDR
We propose a method for automatically finding the formulation group of any given Mixed-Integer Nonlinear Program, and for reformulating the problem by means of static symmetry breaking constraints. Expand
  • 60
  • 6
  • PDF
An improved column generation algorithm for minimum sum-of-squares clustering
TLDR
We propose a new way to solve the auxiliary problem of finding a column with negative reduced cost based on geometric arguments. Expand
  • 61
  • 5
  • PDF
A storm of feasibility pumps for nonconvex MINLP
TLDR
We present a new feasibility pump algorithm tailored for nonconvex Mixed-Integer Nonlinear Programs. Expand
  • 59
  • 5
  • PDF