| 2007 |
| 12 | EE | Pasquale Carotenuto,
Stefano Giordani,
Salvatore Ricciardelli:
Finding minimum and equitable risk routes for hazmat shipments.
Computers & OR 34(5): 1304-1327 (2007) |
| 11 | EE | Pasquale Carotenuto,
Stefano Giordani,
Salvatore Ricciardelli,
Silvia Rismondo:
A tabu search approach for scheduling hazmat shipments.
Computers & OR 34(5): 1328-1350 (2007) |
| 2006 |
| 10 | EE | Lucio Bianco,
Paolo Dell'Olmo,
Stefano Giordani:
Scheduling models for air traffic control in terminal areas.
J. Scheduling 9(3): 223-253 (2006) |
| 2004 |
| 9 | EE | Massimiliano Caramia,
Stefano Giordani,
Antonio Iovanella:
Grid scheduling by on-line rectangle packing.
Networks 44(2): 106-119 (2004) |
| 2003 |
| 8 | | Giuseppe Confessore,
Stefano Giordani,
Giuseppe Stecca:
A Distributed Simulation Model For Inventory Management In A Supply Chain.
PRO-VE 2003: 423-430 |
| 7 | EE | Massimiliano Caramia,
Stefano Giordani,
Antonio Iovanella:
An On-Line Algorithm for the Rectangle Packing Problem with Rejection.
WEA 2003: 59-69 |
| 6 | EE | Giuseppe Confessore,
Paolo Dell'Olmo,
Stefano Giordani:
Complexity and approximation results for scheduling multiprocessor tasks on a ring.
Discrete Applied Mathematics 133(1-3): 29-44 (2003) |
| 2002 |
| 5 | | Massimiliano Caramia,
Pasquale Carotenuto,
Stefano Giordani,
Antonio Iovanella:
Using Rejection Methods in a DSS for Production Strategies.
BASYS 2002: 419-426 |
| 4 | | Giuseppe Confessore,
Paolo Dell'Olmo,
Stefano Giordani:
An approximation result for the interval coloring problem on claw-free chordal graphs.
Discrete Applied Mathematics 120(1-3): 73-90 (2002) |
| 2001 |
| 3 | | Giuseppe Confessore,
Paolo Dell'Olmo,
Stefano Giordani:
An approximation result for a periodic allocation problem.
Discrete Applied Mathematics 112(1-3): 53-72 (2001) |
| 1999 |
| 2 | EE | Giuseppe Confessore,
Paolo Dell'Olmo,
Stefano Giordani:
Vertex Partitioning of Crown-Free Interval Graphs.
WG 1999: 391-401 |
| 1997 |
| 1 | EE | Paolo Dell'Olmo,
Stefano Giordani,
Maria Grazia Speranza:
An Approximation Result for a Duo-Processor Task Scheduling Problem.
Inf. Process. Lett. 61(4): 195-200 (1997) |