Остановите войну!
for scientists:
default search action
Paolo Dell'Olmo
- > Home > Persons > Paolo Dell'Olmo
Publications
- 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
- [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
- [j37]Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
CHECKCOL: Improved local search for graph coloring. J. Discrete Algorithms 4(2): 277-298 (2006) - 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
- [j29]Massimiliano Caramia, Paolo Dell'Olmo:
Bounding vertex coloring by truncated multistage branch and bound. Networks 44(4): 231-242 (2004) - 2003
- [j25]Massimiliano Caramia, Paolo Dell'Olmo:
Assessing the resource usage in scheduling with incompatibilities. OR Spectr. 25(4): 521-547 (2003) - 2002
- [j23]Massimiliano Caramia, Paolo Dell'Olmo:
Constraint Propagation in Graph Coloring. J. Heuristics 8(1): 83-107 (2002) - 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
- [c5]Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
New Algorithms for Examination Timetabling. WAE 2000: 230-242 - 1999
- [c4]Massimiliano Caramia, Paolo Dell'Olmo:
A Fast and Simple Local Search for Graph Coloring. WAE 1999: 317-330
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-02-07 04:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint