Search the dblp DataBase

Publications of Author

1. Roberto Cordone, Fabrizio Ferrandi, Marco D. Santambrogio, Gianluca Palermo, Donatella Sciuto
   Using speculative computation and parallelizing techniques to improve scheduling of control based designs. [Citation Graph (0, 0)][DBLP]
   ASP-DAC, 2006, pp:898-904 [Conf]
   
2. Roberto Cordone, Fabrizio Ferrandi, Donatella Sciuto, Roberto Wolfler Calvo
   An Efficient Heuristic Approach to Solve the Unate Covering Problem. [Citation Graph (0, 0)][DBLP]
   DATE, 2000, pp:364-371 [Conf]
   
3. Roberto Cordone, Francesco Maffioli
   Coloured Ant System and Local Search to Design Local Telecommunication Networks. [Citation Graph (0, 0)][DBLP]
   EvoWorkshops, 2001, pp:60-69 [Conf]
   
4. Anna Bernasconi, Valentina Ciriani, Roberto Cordone
   An approximation algorithm for fully testable kEP-SOP networks. [Citation Graph (0, 0)][DBLP]
   ACM Great Lakes Symposium on VLSI, 2007, pp:417-422 [Conf]
   
5. Roberto Cordone, Marco Trubian
   An exact algorithm for the node weighted Steiner tree problem. [Citation Graph (0, 0)][DBLP]
   4OR, 2006, v:4, n:2, pp:124-144 [Journal]
   
6. Roberto Wolfler Calvo, Roberto Cordone
   A heuristic approach to the overnight security service problem. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2003, v:30, n:9, pp:1269-1287 [Journal]
   
7. Roberto Cordone, Francesco Maffioli
   On the complexity of graph tree partition problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:51-65 [Journal]
   
8. Roberto Cordone
   A subexponential algorithm for the coloured tree partition problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:10, pp:1326-1335 [Journal]
   
9. Roberto Cordone, Roberto Wolfler Calvo
   A Heuristic for the Vehicle Routing Problem with Time Windows. [Citation Graph (0, 0)][DBLP]
   J. Heuristics, 2001, v:7, n:2, pp:107-129 [Journal]
   
10. Roberto Cordone, Fabrizio Ferrandi, Donatella Sciuto, Roberto Wolfler Calvo
    An efficient heuristic approach to solve the unate covering problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2001, v:20, n:12, pp:1377-1388 [Journal]
    
11. Roberto Cordone, Lucca Ferrarini, Luigi Piroddi
    Enumeration algorithms for minimal siphons in Petri nets based on place constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part A, 2005, v:35, n:6, pp:844-854 [Journal]
    
12. Anna Bernasconi, Valentina Ciriani, Roberto Cordone
    EXOR Projected Sum of Products. [Citation Graph (0, 0)][DBLP]
    VLSI-SoC, 2006, pp:284-289 [Conf]
    
13. 
    On Projecting Sums of Products. [Citation Graph (, )][DBLP]
    
    
14. 
    Heuristic and exact approaches to the Quadratic Minimum Spanning Tree Problem. [Citation Graph (, )][DBLP]
    
    
15. 
    Balanced Clustering for Efficient Detection of Scientific Plagiarism. [Citation Graph (, )][DBLP]
    
    
16. 
    Bounds and Solutions for Strategic, Tactical and Operational Ambulance Location. [Citation Graph (, )][DBLP]
    
    
17. 
    Tabu Search versus GRASP for the maximum diversity problem. [Citation Graph (, )][DBLP]
    
    
18. 
    Solving the swath segment selection problem through Lagrangean relaxation. [Citation Graph (, )][DBLP]