| 2008 |
|---|
| 21 | EE | Massimiliano Caramia,
Paolo Dell'Olmo:
Coloring graphs by iterated local search traversing feasible and infeasible solutions.
Discrete Applied Mathematics 156(2): 201-217 (2008) |
| 20 | EE | Massimiliano Caramia,
Stefano Giordani:
On the effectiveness of the Harmonic Shelf Algorithm for on-line strip packing.
Discrete Mathematics 308(16): 3699-3703 (2008) |
| 19 | EE | Massimiliano Caramia,
Paolo Dell'Olmo:
Embedding a novel objective function in a two-phased local search for robust vertex coloring.
European Journal of Operational Research 189(3): 1358-1380 (2008) |
| 18 | EE | Massimiliano Caramia,
Paolo Dell'Olmo,
Giuseppe F. Italiano:
Novel Local-Search-Based Approaches to University Examination Timetabling.
INFORMS Journal on Computing 20(1): 86-99 (2008) |
| 17 | EE | Massimiliano Caramia,
Antonino Sgalambro:
On the approximation of the single source k-splittable flow problem.
J. Discrete Algorithms 6(2): 277-289 (2008) |
| 16 | EE | Massimiliano Caramia,
Antonino Sgalambro:
An exact approach for the maximum concurrent k -splittable flow problem.
Optimization Letters 2(2): 251-265 (2008) |
| 2007 |
|---|
| 15 | EE | Massimiliano Caramia,
Paolo Dell'Olmo,
Monica Gentili,
Pitu B. Mirchandani:
Delivery itineraries and distribution capacity of a freight network with time slots.
Computers & OR 34(6): 1585-1600 (2007) |
| 2006 |
|---|
| 14 | EE | Massimiliano Caramia,
Paolo Dell'Olmo,
Giuseppe F. Italiano:
CHECKCOL: Improved local search for graph coloring.
J. Discrete Algorithms 4(2): 277-298 (2006) |
| 2004 |
|---|
| 13 | EE | Nicola Apollonio,
Massimiliano Caramia,
Giuseppe F. Italiano:
A Stochastic Location Problem with Applications to Tele-diagnostic.
WG 2004: 201-213 |
| 12 | EE | Massimiliano Caramia,
Giovanni Felici,
A. Pezzoli:
Improving search results with data mining in a thematic search engine.
Computers & OR 31(14): 2387-2404 (2004) |
| 11 | EE | Massimiliano Caramia,
Stefano Giordani,
Antonio Iovanella:
Grid scheduling by on-line rectangle packing.
Networks 44(2): 106-119 (2004) |
| 10 | EE | Massimiliano Caramia,
Paolo Dell'Olmo:
Bounding vertex coloring by truncated multistage branch and bound.
Networks 44(4): 231-242 (2004) |
| 2003 |
|---|
| 9 | EE | Massimiliano Caramia,
Stefano Giordani,
Antonio Iovanella:
An On-Line Algorithm for the Rectangle Packing Problem with Rejection.
WEA 2003: 59-69 |
| 8 | EE | Massimiliano Caramia,
Stefano Giordani:
A new graph model and heuristic algorithm for multi-mode task scheduling problem.
Electronic Notes in Discrete Mathematics 13: 30-33 (2003) |
| 2002 |
|---|
| 7 | | Massimiliano Caramia,
Pasquale Carotenuto,
Stefano Giordani,
Antonio Iovanella:
Using Rejection Methods in a DSS for Production Strategies.
BASYS 2002: 419-426 |
| 6 | EE | Evripidis Bampis,
Massimiliano Caramia,
Jirí Fiala,
Aleksei V. Fishkin,
Antonio Iovanella:
Scheduling of Independent Dedicated Multiprocessor Tasks.
ISAAC 2002: 391-402 |
| 5 | | Massimiliano Caramia,
Paolo Dell'Olmo:
Constraint Propagation in Graph Coloring.
J. Heuristics 8(1): 83-107 (2002) |
| 2001 |
|---|
| 4 | EE | Massimiliano Caramia,
Paolo Dell'Olmo:
A lower bound on the chromatic number of Mycielski graphs.
Discrete Mathematics 235(1-3): 79-86 (2001) |
| 3 | EE | Massimiliano Caramia,
Paolo Dell'Olmo:
Solving the minimum-weighted coloring problem.
Networks 38(2): 88-101 (2001) |
| 2000 |
|---|
| 2 | EE | Massimiliano Caramia,
Paolo Dell'Olmo,
Giuseppe F. Italiano:
New Algorithms for Examination Timetabling.
Algorithm Engineering 2000: 230-242 |
| 1999 |
|---|
| 1 | EE | Massimiliano Caramia,
Paolo Dell'Olmo:
A Fast and Simple Local Search for Graph Coloring.
Algorithm Engineering 1999: 317-330 |
