| 2009 |
|---|
| 24 | EE | Carlile Lavor,
Leo Liberti,
Antonio Mucherino,
Nelson Maculan:
On a discretizable subclass of instances of the molecular distance geometry problem.
SAC 2009: 804-805 |
| 23 | EE | Carlile Lavor,
Leo Liberti,
Nelson Maculan:
Molecular Distance Geometry Problem.
Encyclopedia of Optimization 2009: 2304-2311 |
| 22 | EE | Hanif D. Sherali,
Leo Liberti:
Reformulation-Linearization Technique for Global Optimization.
Encyclopedia of Optimization 2009: 3263-3268 |
| 2008 |
|---|
| 21 | EE | Leo Liberti,
Franco Raimondi:
The Secret Santa Problem.
AAIM 2008: 271-279 |
| 20 | EE | Giacomo Nannicini,
Philippe Baptiste,
Daniel Krob,
Leo Liberti:
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks.
COCOA 2008: 225-234 |
| 19 | EE | Leo Liberti:
Automatic Generation of Symmetry-Breaking Constraints.
COCOA 2008: 328-338 |
| 18 | | Giacomo Nannicini,
Daniel Delling,
Leo Liberti,
Dominik Schultes:
Bidirectional A* on Time-dependent Graphs.
CTW 2008: 132-135 |
| 17 | | Leo Liberti:
Reformulations in Mathematical Programming: Definitions.
CTW 2008: 66-70 |
| 16 | EE | Kanika Dhyani,
Leo Liberti:
Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem.
MCO 2008: 87-96 |
| 15 | EE | Giacomo Nannicini,
Daniel Delling,
Leo Liberti,
Dominik Schultes:
Bidirectional A* Search for Time-Dependent Fast Paths.
WEA 2008: 334-346 |
| 2007 |
|---|
| 14 | | Leo Liberti:
A useful characterization of the feasible region of binary linear programs.
CTW 2007: 103-106 |
| 13 | | Giacomo Nannicini,
Philippe Baptiste,
Daniel Krob,
Leo Liberti:
Fast point-to-point shortest path queries on dynamic road networks with interfal data.
CTW 2007: 115-118 |
| 12 | | Marie-Christine Plateau,
Leo Liberti,
Laurent Alfandari:
Edge cover by bipartite subgraphs.
CTW 2007: 127-132 |
| 11 | EE | Leo Liberti:
Compact linearization for binary quadratic problems.
4OR 5(3): 231-245 (2007) |
| 10 | EE | Giacomo Nannicini,
Philippe Baptiste,
Gilles Barbier,
Daniel Krob,
Leo Liberti:
Fast paths in large-scale dynamic road networks
CoRR abs/0704.1068: (2007) |
| 9 | EE | Sergei Kucherenko,
Pietro Belotti,
Leo Liberti,
Nelson Maculan:
New formulations for the Kissing Number Problem.
Discrete Applied Mathematics 155(14): 1837-1841 (2007) |
| 2006 |
|---|
| 8 | EE | Ulrich Faigle,
Leo Liberti,
Francesco Maffioli,
Stefan Pickl:
Graphs and combinatorial optimization.
Discrete Optimization 3(3): 179 (2006) |
| 2004 |
|---|
| 7 | EE | Edoardo Amaldi,
Leo Liberti,
Nelson Maculan,
Francesco Maffioli:
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases.
WEA 2004: 14-29 |
| 6 | EE | Leo Liberti:
Reformulation and convex relaxation techniques for global optimization.
4OR 2(3): 255-258 (2004) |
| 5 | EE | Leo Liberti,
Francesco Maffioli:
Preface.
Electronic Notes in Discrete Mathematics 17: 1 (2004) |
| 4 | EE | Leo Liberti,
Nelson Maculan,
Sergei Kucherenko:
The Kissing Number Problem: A New Result from Global Optimization.
Electronic Notes in Discrete Mathematics 17: 203-207 (2004) |
| 3 | EE | Edoardo Amaldi,
Leo Liberti,
Francesco Maffioli,
Nelson Maculan:
Algorithms for finding minimum fundamental cycle bases in graphs.
Electronic Notes in Discrete Mathematics 17: 29-33 (2004) |
| 2002 |
|---|
| 2 | EE | Leo Liberti:
Performance Comparison of Function Evaluation Methods
CoRR cs.SC/0206010: (2002) |
| 1999 |
|---|
| 1 | | Leo Liberti:
Structure of the Invertible CA Transformations Group.
J. Comput. Syst. Sci. 59(3): 521-536 (1999) |
