Search the dblp DataBase

Publications of Author

1. Massimiliano Caramia, Pasquale Carotenuto, Stefano Giordani, Antonio Iovanella
   Using Rejection Methods in a DSS for Production Strategies. [Citation Graph (0, 0)][DBLP]
   BASYS, 2002, pp:419-426 [Conf]
   
2. Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella
   Scheduling of Independent Dedicated Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2002, pp:391-402 [Conf]
   
3. Massimiliano Caramia, Paolo Dell'Olmo
   A Fast and Simple Local Search for Graph Coloring. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1999, pp:317-330 [Conf]
   
4. Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano
   New Algorithms for Examination Timetabling. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 2000, pp:230-242 [Conf]
   
5. Massimiliano Caramia, Stefano Giordani, Antonio Iovanella
   An On-Line Algorithm for the Rectangle Packing Problem with Rejection. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:59-69 [Conf]
   
6. Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano
   A Stochastic Location Problem with Applications to Tele-diagnostic. [Citation Graph (0, 0)][DBLP]
   WG, 2004, pp:201-213 [Conf]
   
7. Massimiliano Caramia, Giovanni Felici, A. Pezzoli
   Improving search results with data mining in a thematic search engine. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2004, v:31, n:14, pp:2387-2404 [Journal]
   
8. Massimiliano Caramia, Paolo Dell'Olmo, Monica Gentili, Pitu B. Mirchandani
   Delivery itineraries and distribution capacity of a freight network with time slots. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2007, v:34, n:6, pp:1585-1600 [Journal]
   
9. Massimiliano Caramia, Paolo Dell'Olmo
   A lower bound on the chromatic number of Mycielski graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:235, n:1-3, pp:79-86 [Journal]
   
10. Massimiliano Caramia, Paolo Dell'Olmo
    Constraint Propagation in Graph Coloring. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2002, v:8, n:1, pp:83-107 [Journal]
    
11. Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano
    CHECKCOL: Improved local search for graph coloring. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:2, pp:277-298 [Journal]
    
12. Massimiliano Caramia, Paolo Dell'Olmo
    Solving the minimum-weighted coloring problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:2, pp:88-101 [Journal]
    
13. Massimiliano Caramia, Paolo Dell'Olmo
    Bounding vertex coloring by truncated multistage branch and bound. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:4, pp:231-242 [Journal]
    
14. Massimiliano Caramia, Stefano Giordani, Antonio Iovanella
    Grid scheduling by on-line rectangle packing. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:2, pp:106-119 [Journal]
    
15. 
    An Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Feeding Precedence Relations. [Citation Graph (, )][DBLP]
    
    
16. 
    Integrality Properties of Certain Special Balanceable Families. [Citation Graph (, )][DBLP]
    
    
17. 
    A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations. [Citation Graph (, )][DBLP]
    
    
18. 
    Coloring graphs by iterated local search traversing feasible and infeasible solutions. [Citation Graph (, )][DBLP]
    
    
19. 
    On the effectiveness of the Harmonic Shelf Algorithm for on-line strip packing. [Citation Graph (, )][DBLP]