default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaolo Dell'Olmo
- > Home > Persons > Paolo Dell'Olmo
Publications
- 2011
[j46]Giovanni Andreatta, Paolo Dell'Olmo, Guglielmo Lulli
:
An aggregate stochastic programming model for air traffic flow management. Eur. J. Oper. Res. 215(3): 697-704 (2011)- [c7]Paolo Dell'Olmo, Raffaele Cerulli, Francesco Carrabs:
The maximum labeled clique problem. CTW 2011: 146-149 - [c6]Paolo Dell'Olmo, Antonino Sgalambro:
The Spatially Equitable Multicommodity Capacitated Network Flow Problem. INOC 2011: 196-209 - 2008
- [j45]Paolo Dell'Olmo, Antonio Iovanella, Guglielmo Lulli, Benedetto Scoppola:
Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates. Comput. Oper. Res. 35(5): 1589-1600 (2008) - [j44]Massimiliano Caramia, Paolo Dell'Olmo:
Coloring graphs by iterated local search traversing feasible and infeasible solutions. Discret. Appl. Math. 156(2): 201-217 (2008) - [j43]Massimiliano Caramia, Paolo Dell'Olmo:
Embedding a novel objective function in a two-phased local search for robust vertex coloring. Eur. J. Oper. Res. 189(3): 1358-1380 (2008) - [j42]Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
Novel Local-Search-Based Approaches to University Examination Timetabling. INFORMS J. Comput. 20(1): 86-99 (2008) - 2007
- [j41]Paolo Dell'Olmo, Raffaele Pesenti, Maria Grazia Speranza:
Editorial. Comput. Oper. Res. 34(6): 1515 (2007) - [j40]Massimiliano Caramia, Paolo Dell'Olmo, Monica Gentili, Pitu B. Mirchandani:
Delivery itineraries and distribution capacity of a freight network with time slots. Comput. Oper. Res. 34(6): 1585-1600 (2007) - [j39]Massimiliano Caramia, Paolo Dell'Olmo:
Coupling Stochastic and Deterministic Local Search in Examination Timetabling. Oper. Res. 55(2): 351-366 (2007) - 2006
- [j38]Raffaele Cerulli, Paolo Dell'Olmo, Monica Gentili, Andrea Raiconi:
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem. Electron. Notes Discret. Math. 25: 131-138 (2006) - [j37]Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
CHECKCOL: Improved local search for graph coloring. J. Discrete Algorithms 4(2): 277-298 (2006) - [j36]Paolo Dell'Olmo, Monica Gentili:
Graph models for scheduling systems with machine saturation property. Math. Methods Oper. Res. 63(2): 329-340 (2006) - [j35]Lucio Bianco, Paolo Dell'Olmo, Stefano Giordani:
Scheduling models for air traffic control in terminal areas. J. Sched. 9(3): 223-253 (2006) - 2005
- [j34]Giuseppe Confessore, Paolo Dell'Olmo, Monica Gentili:
Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem. Comput. Oper. Res. 32: 2383-2405 (2005) - [j33]Paolo Dell'Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi:
On uniform k-partition problems. Discret. Appl. Math. 150(1-3): 121-139 (2005) - [j32]Paolo Dell'Olmo, Monica Gentili, Andrea Scozzari:
On finding dissimilar Pareto-optimal paths. Eur. J. Oper. Res. 162(1): 70-82 (2005) - [j31]Massimiliano Caramia, Paolo Dell'Olmo, Antonio Iovanella:
Lower bound algorithms for multiprocessor task scheduling with ready times. Int. Trans. Oper. Res. 12(5): 481-508 (2005) - 2004
- [j30]Paolo Dell'Olmo, Guglielmo Lulli:
Planning Activities in a Network of Logistic Platforms with Shared Resources. Ann. Oper. Res. 129(1-4): 155-169 (2004) - [j29]Massimiliano Caramia, Paolo Dell'Olmo:
Bounding vertex coloring by truncated multistage branch and bound. Networks 44(4): 231-242 (2004) - 2003
- [j28]Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani:
Complexity and approximation results for scheduling multiprocessor tasks on a ring. Discret. Appl. Math. 133(1-3): 29-44 (2003) - [j27]Paolo Dell'Olmo, Guglielmo Lulli:
A new hierarchical architecture for Air Traffic Management: Optimisation of airway capacity in a Free Flight scenario. Eur. J. Oper. Res. 144(1): 179-193 (2003) - [j26]Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski, Przemyslaw Maczka:
Scheduling multiprocessor tasks on parallel processors with limited availability. Eur. J. Oper. Res. 149(2): 377-389 (2003) - [j25]Massimiliano Caramia, Paolo Dell'Olmo:
Assessing the resource usage in scheduling with incompatibilities. OR Spectr. 25(4): 521-547 (2003) - 2002
- [j24]Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani:
An approximation result for the interval coloring problem on claw-free chordal graphs. Discret. Appl. Math. 120(1-3): 73-90 (2002) - [j23]Massimiliano Caramia, Paolo Dell'Olmo:
Constraint Propagation in Graph Coloring. J. Heuristics 8(1): 83-107 (2002) - [j22]Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski:
Scheduling multiprocessor tasks on two parallel processors. RAIRO Oper. Res. 36(1): 37-51 (2002) - 2001
- [j21]Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani:
An approximation result for a periodic allocation problem. Discret. Appl. Math. 112(1-3): 53-72 (2001) - [j20]Massimiliano Caramia, Paolo Dell'Olmo:
A lower bound on the chromatic number of Mycielski graphs. Discret. Math. 235(1-3): 79-86 (2001) - [j19]Massimiliano Caramia, Paolo Dell'Olmo:
Solving the minimum-weighted coloring problem. Networks 38(2): 88-101 (2001) - 2000
- [j18]Maciej Drozdowski, Paolo Dell'Olmo:
Scheduling multiprocessor tasks for mean flow time criterion. Comput. Oper. Res. 27(6): 571-585 (2000) - [c5]Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
New Algorithms for Examination Timetabling. WAE 2000: 230-242 - 1999
- [j17]Lucio Bianco, Paolo Dell'Olmo, Stefano Giordani:
Minimizing total completion time subject to release dates and sequence-dependentprocessing times. Ann. Oper. Res. 86: 393-415 (1999) - [j16]Paolo Dell'Olmo, Maria Grazia Speranza:
Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size. Discret. Appl. Math. 94(1-3): 181-191 (1999) - [c4]Massimiliano Caramia, Paolo Dell'Olmo:
A Fast and Simple Local Search for Graph Coloring. WAE 1999: 317-330 - [c3]Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani:
Vertex Partitioning of Crown-Free Interval Graphs. WG 1999: 391-401 - 1998
- [j15]Lucio Bianco, Paolo Dell'Olmo, Maria Grazia Speranza:
Heuristics for multimode scheduling problems with dedicated resources. Eur. J. Oper. Res. 107(2): 260-271 (1998) - [j14]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
- [j13]Lucio Bianco, Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski:
Preemptive multiprocessor task scheduling with release times and time windows. Ann. Oper. Res. 70: 43-55 (1997) - [j12]Lucio Bianco, Paolo Dell'Olmo, Stefano Giordani:
An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets. Comput. Optim. Appl. 8(2): 197-210 (1997) - [j11]Lucio Bianco, Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski:
Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness. Discret. Appl. Math. 72(1-2): 25-46 (1997) - [j10]Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza:
Comparability Graph Augmentation for some Multiprocessor Scheduling Problems. Discret. Appl. Math. 72(1-2): 71-84 (1997) - [j9]Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza:
Efficiency and effectiveness of normal schedules on three dedicated processors. Discret. Math. 164(1-3): 67-79 (1997) - [j8]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) - [j7]Moshe Dror, Wieslaw Kubiak, Paolo Dell'Olmo:
Scheduling Chains to Minimize Mean Flow Time. Inf. Process. Lett. 61(6): 297-301 (1997) - 1995
- [j6]Lucio Bianco, Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski:
Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors. Ann. Oper. Res. 58(7): 493-517 (1995) - [j5]Lucio Bianco, Paolo Dell'Olmo, Maria Grazia Speranza:
Scheduling Independent Tasks with Multiple Modes. Discret. Appl. Math. 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. Evaluation 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) - [c2]Lucio Bianco, Paolo Dell'Olmo:
The minimization of resource costs in scheduling independent tasks with fixed completion time. System Modelling and Optimization 1993: 783-794 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
