Urmăriți
Leo Liberti
Titlu
Citat de
Citat de
Anul
Branching and bounds tighteningtechniques for non-convex MINLP
P Belotti, J Lee, L Liberti, F Margot, A Wächter
Optimization Methods & Software 24 (4-5), 597-634, 2009
7852009
Euclidean distance geometry and applications
L Liberti, C Lavor, N Maculan, A Mucherino
SIAM review 56 (1), 3-69, 2014
5662014
Global optimization: from theory to implementation
L Liberti, N Maculan
Springer Science & Business Media, 2006
2052006
A branch‐and‐prune algorithm for the molecular distance geometry problem
L Liberti, C Lavor, N Maculan
International Transactions in Operational Research 15 (1), 1-17, 2008
1982008
The discretizable molecular distance geometry problem
C Lavor, L Liberti, N Maculan, A Mucherino
Computational Optimization and Applications 52, 115-146, 2012
1962012
Surrogate‐based methods for black‐box optimization
KK Vu, C d'Ambrosio, Y Hamadi, L Liberti
International Transactions in Operational Research 24 (3), 393-424, 2017
1762017
Column generation algorithms for exact modularity maximization in networks
D Aloise, S Cafieri, G Caporossi, P Hansen, S Perron, L Liberti
Physical Review E 82 (4), 046112, 2010
1732010
Distance geometry: theory, methods, and applications
A Mucherino, C Lavor, L Liberti, N Maculan
Springer Science & Business Media, 2012
1672012
Bidirectional A  ∗  Search for Time-Dependent Fast Paths
G Nannicini, D Delling, L Liberti, D Schultes
Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown …, 2008
1632008
An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms
L Liberti, CC Pantelides
Journal of Global Optimization 36, 161-189, 2006
1612006
Molecular distance geometry methods: from continuous to discrete
L Liberti, C Lavor, A Mucherino, N Maculan
International Transactions in Operational Research 18 (1), 33-51, 2011
1442011
An improved column generation algorithm for minimum sum-of-squares clustering
D Aloise, P Hansen, L Liberti
Mathematical Programming 131, 195-220, 2012
1372012
Bidirectional A* search on time‐dependent road networks
G Nannicini, D Delling, D Schultes, L Liberti
Networks 59 (2), 240-251, 2012
1342012
Reformulations in mathematical programming: A computational approach
L Liberti, S Cafieri, F Tarissan
Foundations of Computational Intelligence Volume 3: Global Optimization, 153-234, 2009
1212009
The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances
C Lavor, L Liberti, A Mucherino
Journal of Global Optimization 56 (3), 855-871, 2013
1162013
Comparison of deterministic and stochastic approaches to global optimization
L Liberti, S Kucherenko
International Transactions in Operational Research 12 (3), 263-285, 2005
1052005
The discretizable distance geometry problem
A Mucherino, C Lavor, L Liberti
Optimization Letters 6 (8), 1671-1686, 2012
1022012
Recent advances on the discretizable molecular distance geometry problem
C Lavor, L Liberti, N Maculan, A Mucherino
European Journal of Operational Research 219 (3), 698-706, 2012
1022012
A storm of feasibility pumps for nonconvex MINLP
C D’Ambrosio, A Frangioni, L Liberti, A Lodi
Mathematical programming 136, 375-402, 2012
982012
Convex envelopes of monomials of odd degree
L Liberti, CC Pantelides
Journal of Global Optimization 25, 157-168, 2003
982003
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20