- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j39 |      | Giovanni Andreatta, Paolo Dell'Olmo, Guglielmo Lulli: An aggregate stochastic programming model for air traffic flow management. European Journal of Operational Research 215(3): 697-704 (2011) |
| c6 | | Paolo Dell'Olmo, Raffaele Cerulli, Francesco Carrabs: The maximum labeled clique problem. CTW 2011: 146-149 |
| c5 | | Paolo Dell'Olmo, Antonino Sgalambro: The Spatially Equitable Multicommodity Capacitated Network Flow Problem. INOC 2011: 196-209 |
| 2008 | ||
| j38 | | Paolo Dell'Olmo, Antonio Iovanella, Guglielmo Lulli, Benedetto Scoppola: Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates. Computers & OR 35(5): 1589-1600 (2008) |
| j37 | | Massimiliano Caramia, Paolo Dell'Olmo: Coloring graphs by iterated local search traversing feasible and infeasible solutions. Discrete Applied Mathematics 156(2): 201-217 (2008) |
| j36 | | 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) |
| j35 | | 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) |
| 2007 | ||
| j34 | | Paolo Dell'Olmo, Raffaele Pesenti, Maria Grazia Speranza: Editorial. Computers & OR 34(6): 1515 (2007) |
| j33 | | 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) |
| j32 | | Massimiliano Caramia, Paolo Dell'Olmo: Coupling Stochastic and Deterministic Local Search in Examination Timetabling. Operations Research 55(2): 351-366 (2007) |
| 2006 | ||
| j31 | | Raffaele Cerulli, Paolo Dell'Olmo, Monica Gentili, Andrea Raiconi: Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem. Electronic Notes in Discrete Mathematics 25: 131-138 (2006) |
| j30 | | Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano: CHECKCOL: Improved local search for graph coloring. J. Discrete Algorithms 4(2): 277-298 (2006) |
| j29 | | Paolo Dell'Olmo, Monica Gentili: Graph models for scheduling systems with machine saturation property. Math. Meth. of OR 63(2): 329-340 (2006) |
| j28 | | Lucio Bianco, Paolo Dell'Olmo, Stefano Giordani: Scheduling models for air traffic control in terminal areas. J. Scheduling 9(3): 223-253 (2006) |
| 2005 | ||
| j27 | | Giuseppe Confessore, Paolo Dell'Olmo, Monica Gentili: Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem. Computers & OR 32: 2383-2405 (2005) |
| j26 | | Paolo Dell'Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi: On uniform k-partition problems. Discrete Applied Mathematics 150(1-3): 121-139 (2005) |
| j25 | | Paolo Dell'Olmo, Monica Gentili, Andrea Scozzari: On finding dissimilar Pareto-optimal paths. European Journal of Operational Research 162(1): 70-82 (2005) |
| 2004 | ||
| j24 | | Paolo Dell'Olmo, Guglielmo Lulli: Planning Activities in a Network of Logistic Platforms with Shared Resources. Annals OR 129(1-4): 155-169 (2004) |
| j23 | | Massimiliano Caramia, Paolo Dell'Olmo: Bounding vertex coloring by truncated multistage branch and bound. Networks 44(4): 231-242 (2004) |
| 2003 | ||
| j22 | | 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) |
| j21 | | Paolo Dell'Olmo, Guglielmo Lulli: A new hierarchical architecture for Air Traffic Management: Optimisation of airway capacity in a Free Flight scenario. European Journal of Operational Research 144(1): 179-193 (2003) |
| j20 | | Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski, Przemyslaw Maczka: Scheduling multiprocessor tasks on parallel processors with limited availability. European Journal of Operational Research 149(2): 377-389 (2003) |
| 2002 | ||
| j19 | | 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) |
| j18 | | Massimiliano Caramia, Paolo Dell'Olmo: Constraint Propagation in Graph Coloring. J. Heuristics 8(1): 83-107 (2002) |
| j17 | | Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski: Scheduling multiprocessor tasks on two parallel processors. RAIRO - Operations Research 36(1): 37-51 (2002) |
| 2001 | ||
| j16 | | Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani: An approximation result for a periodic allocation problem. Discrete Applied Mathematics 112(1-3): 53-72 (2001) |
| j15 | | Massimiliano Caramia, Paolo Dell'Olmo: A lower bound on the chromatic number of Mycielski graphs. Discrete Mathematics 235(1-3): 79-86 (2001) |
| j14 | | Massimiliano Caramia, Paolo Dell'Olmo: Solving the minimum-weighted coloring problem. Networks 38(2): 88-101 (2001) |
| 2000 | ||
| j13 | | Maciej Drozdowski, Paolo Dell'Olmo: Scheduling multiprocessor tasks for mean flow time criterion. Computers & OR 27(6): 571-585 (2000) |
| c4 | | Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano: New Algorithms for Examination Timetabling. Algorithm Engineering 2000: 230-242 |
| 1999 | ||
| j12 | | Paolo Dell'Olmo, Maria Grazia Speranza: Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size. Discrete Applied Mathematics 94(1-3): 181-191 (1999) |
| c3 | | Massimiliano Caramia, Paolo Dell'Olmo: A Fast and Simple Local Search for Graph Coloring. Algorithm Engineering 1999: 317-330 |
| c2 | | Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani: Vertex Partitioning of Crown-Free Interval Graphs. WG 1999: 391-401 |
| 1998 | ||
| j11 | | Paolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza: A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. Inf. Process. Lett. 65(5): 229-233 (1998) |
| 1997 | ||
| j10 | | Lucio Bianco, Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski: Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness. Discrete Applied Mathematics 72(1-2): 25-46 (1997) |
| j9 | | Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza: Comparability Graph Augmentation for some Multiprocessor Scheduling Problems. Discrete Applied Mathematics 72(1-2): 71-84 (1997) |
| j8 | | Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza: Efficiency and effectiveness of normal schedules on three dedicated processors. Discrete Mathematics 164(1-3): 67-79 (1997) |
| j7 | | 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) |
| j6 | | Moshe Dror, Wieslaw Kubiak, Paolo Dell'Olmo: Scheduling Chains to Minimize Mean Flow Time. Inf. Process. Lett. 61(6): 297-301 (1997) |
| 1995 | ||
| j5 | | Lucio Bianco, Paolo Dell'Olmo, Maria Grazia Speranza: Scheduling Independent Tasks with Multiple Modes. Discrete Applied Mathematics 62(1-3): 35-50 (1995) |
| 1994 | ||
| j4 |  | Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski, Maria Grazia Speranza: Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors. Inf. Process. Lett. 49(5): 269-270 (1994) |
| j3 | | Lucio Bianco, Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski: Scheduling Preemptive Multiprocessor Tasks on Dedicated Processors. Perform. Eval. 20(4): 361-371 (1994) |
| 1993 | ||
| j2 | | Lucio Bianco, Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski: Preemptive Scheduling of Multiprocessor Tasks on the Dedicated Processor System Subject to Minimal Lateness. Inf. Process. Lett. 46(3): 109-113 (1993) |
| 1992 | ||
| j1 | | Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski, Maria Grazia Speranza: Scheduling Multiprocessor Tasks on Three Dedicated Processors. Inf. Process. Lett. 41(5): 275-280 (1992) |
| 1989 | ||
| c1 | | Paolo Dell'Olmo, Enrico Nardelli, Maurizio Talamo, Paola Vocca: A Mixed-Mode Man-Machine Interface for Interactive Problem Solving. Workstations for Experiments 1989: 28-39 |
Data released under the ODC-BY 1.0 license — See also our legal information page