The SCEAS System
| |||||||

## Search the dblp DataBase
Leo Liberti:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli
**Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases.**[Citation Graph (0, 0)][DBLP] WEA, 2004, pp:14-29 [Conf] - Leo Liberti
**Reformulation and convex relaxation techniques for global optimization.**[Citation Graph (0, 0)][DBLP] 4OR, 2004, v:2, n:3, pp:255-258 [Journal] - Leo Liberti
**Performance Comparison of Function Evaluation Methods**[Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal] - Leo Liberti
**Structure of the Invertible CA Transformations Group.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1999, v:59, n:3, pp:521-536 [Journal] - Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti
**Fast paths in large-scale dynamic road networks**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Sergei Kucherenko, Pietro Belotti, Leo Liberti, Nelson Maculan
**New formulations for the Kissing Number Problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:14, pp:1837-1841 [Journal] **The Secret Santa Problem.**[Citation Graph (, )][DBLP]**Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem.**[Citation Graph (, )][DBLP]**MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems.**[Citation Graph (, )][DBLP]**The Reformulation-Optimization Software Engine.**[Citation Graph (, )][DBLP]**On a discretizable subclass of instances of the molecular distance geometry problem.**[Citation Graph (, )][DBLP]**Experiments with a Feasibility Pump Approach for Nonconvex MINLPs.**[Citation Graph (, )][DBLP]**Bidirectional A**[Citation Graph (, )][DBLP]^{*}Search for Time-Dependent Fast Paths.**Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks.**[Citation Graph (, )][DBLP]**Automatic Generation of Symmetry-Breaking Constraints.**[Citation Graph (, )][DBLP]**Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem.**[Citation Graph (, )][DBLP]**Combinatorial Optimization Based Recommender Systems.**[Citation Graph (, )][DBLP]**Edge cover by bipartite subgraphs.**[Citation Graph (, )][DBLP]**A useful characterization of the feasible region of binary linear programs.**[Citation Graph (, )][DBLP]**Fast point-to-point shortest path queries on dynamic road networks with interfal data.**[Citation Graph (, )][DBLP]**Reformulations in Mathematical Programming: Definitions.**[Citation Graph (, )][DBLP]**Bidirectional**[Citation Graph (, )][DBLP]*A*^{*}on Time-dependent Graphs.**The Anonymous Subgraph Problem.**[Citation Graph (, )][DBLP]**Improved Strategies for Branching on General Disjunctions.**[Citation Graph (, )][DBLP]**Computing artificial backbones of hydrogen atoms in order to discover protein backbones.**[Citation Graph (, )][DBLP]**Compact linearization for binary quadratic problems.**[Citation Graph (, )][DBLP]**Reformulation in mathematical programming: An application to quantum chemistry.**[Citation Graph (, )][DBLP]**Reformulation techniques in mathematical programming.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |