LIBERTI, LEO SERGIO
LIBERTI, LEO SERGIO
A branch-and-price algorithm for the risk-equity constrained routing problem
2011-01-01 Touati-Moungla, Nora; Belotti, Pietro; Jost, Vincent; Liberti, Leo
A local branching heuristic for MINLPs
2008-01-01 Nannicini, Giacomo; Belotti, Pietro; Liberti, Leo
Algorithms for finding minimum fundamental cycle bases in graphs
2004-01-01 Amaldi, Edoardo; Liberti, LEO SERGIO; N., Maculan; Maffioli, Francesco
Branching and bounds tightening techniques for non-convex MINLP
2009-01-01 Belotti, Pietro; Lee, Jon; Liberti, Leo; Margot, Francois; Wächter, Andreas
Disjunctive inequalities: applications and extensions
2010-01-01 Belotti, Pietro; Liberti, Leo; Lodi, Andrea; Nannicini, Giacomo; Tramontani, Andrea
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases
2004-01-01 Amaldi, Edoardo; Liberti, LEO SERGIO; N., Maculan; Maffioli, Francesco
Feasibility-based bounds tightening via fixed points
2010-01-01 Belotti, Pietro; Cafieri, Sonia; Lee, Jon; Liberti, Leo
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
2005-01-01 Liberti, LEO SERGIO; Amaldi, Edoardo; N., Maculan; Maffioli, Francesco
New formulations for the kissing number problem
2007-01-01 Kucherenko, Sergei; Belotti, Pietro; Liberti, Leo; Maculan, Nelson
On the composition of convex envelopes for quadrilinear terms
2013-01-01 Belotti, Pietro; Cafieri, Sonia; Lee, Jon; Liberti, Leo; Miller, Andrew J
QPLIB: a library of quadratic programming instances
2019-01-01 Furini, Fabio; Traversi, Emiliano; Belotti, Pietro; Frangioni, Antonio; Gleixner, Ambros; Gould, Nick; Liberti, Leo; Lodi, Andrea; Misener, Ruth; Mittelmann, Hans; Others,
The minimum fundamental cycle basis problem: a new heuristic based on edge swaps
2003-01-01 Amaldi, Edoardo; Liberti, LEO SERGIO; N., Maculan; Maffioli, Francesco