default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniele Pretolani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c3]Bruno Petrato Bruck, Dario Vezzali
, Manuel Iori, Carlo Alberto Magni, Daniele Pretolani:
A Decision Support System to Evaluate Suppliers in the Context of Global Service Providers. ICEIS (1) 2021: 420-430
2010 – 2019
- 2014
- [j21]Daniele Pretolani:
Apportionments with minimum Gini index of disproportionality: a Quadratic Knapsack approach. Ann. Oper. Res. 215(1): 257-267 (2014) - [j20]Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani:
Ranking paths in stochastic time-dependent networks. Eur. J. Oper. Res. 236(3): 903-914 (2014) - 2013
- [j19]Daniele Pretolani:
Finding hypernetworks in directed hypergraphs. Eur. J. Oper. Res. 230(2): 226-230 (2013) - 2011
- [j18]Daniele Pretolani:
Optimization and probabilistic satisfiability on nested and co-nested formulas. Ann. Oper. Res. 188(1): 371-387 (2011) - 2010
- [j17]Manuel Iori, Silvano Martello, Daniele Pretolani:
An aggregate label setting policy for the multi-objective shortest path problem. Eur. J. Oper. Res. 207(3): 1489-1496 (2010)
2000 – 2009
- 2009
- [j16]Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott:
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. Oper. Res. Lett. 37(3): 201-205 (2009) - 2008
- [j15]Federico Malucelli, Stefano Pallottino, Daniele Pretolani:
The stack loading and unloading problem. Discret. Appl. Math. 156(17): 3248-3266 (2008) - [j14]Mauro Dell'Amico, Manuel Iori, Daniele Pretolani:
Shortest paths in piecewise continuous time-dependent networks. Oper. Res. Lett. 36(6): 688-691 (2008) - 2006
- [j13]Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen:
Finding the K shortest hyperpaths using reoptimization. Oper. Res. Lett. 34(2): 155-164 (2006) - 2005
- [j12]Daniele Pretolani:
Probability logic and optimization SAT: The PSAT and CPA models. Ann. Math. Artif. Intell. 43(1): 211-221 (2005) - [j11]Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani:
Finding the K shortest hyperpaths. Comput. Oper. Res. 32: 1477-1497 (2005) - 2003
- [c2]Daniele Pretolani:
Hypergraph Reductions and Satisfiability Problems. SAT 2003: 383-397 - 2002
- [j10]Alberto Caprara, Federico Malucelli, Daniele Pretolani:
On bandwidth-2 graphs. Discret. Appl. Math. 117(1-3): 1-13 (2002) - 2001
- [j9]Kim Allan Andersen, Daniele Pretolani:
Easy Cases of Probabilistic Satisfiability. Ann. Math. Artif. Intell. 33(1): 69-91 (2001) - 2000
- [j8]Daniele Pretolani:
A directed hypergraph model for random time dependent shortest paths. Eur. J. Oper. Res. 123(2): 315-324 (2000) - [j7]Renato De Leone, Daniele Pretolani:
Auction Algorithms for Shortest Hyperpath Problems. SIAM J. Optim. 11(1): 149-159 (2000)
1990 – 1999
- 1998
- [j6]S. Nguyen, Daniele Pretolani, Lilian Markenzon:
On Some Path Problems on Oriented Hypergraphs. RAIRO Theor. Informatics Appl. 32(1-3): 1-20 (1998) - [j5]Giorgio Gallo, Claudio Gentile, Daniele Pretolani, Gabriella Rago:
Max Horn SAT and the minimum cut problem in directed hypergraphs. Math. Program. 80: 213-237 (1998) - 1996
- [j4]Daniele Pretolani:
Hierarchies of Polynomially Solvable Satisfiability Problems. Ann. Math. Artif. Intell. 17(3-4): 339-357 (1996) - 1995
- [j3]Giorgio Gallo, Daniele Pretolani:
A New Algorithm for the Propositional Satisfiability Problem. Discret. Appl. Math. 60(1-3): 159-179 (1995) - 1993
- [j2]Federico Malucelli, Thomas Ottmann, Daniele Pretolani:
Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem. Discret. Appl. Math. 47(2): 175-179 (1993) - [j1]Daniele Pretolani:
A Linear Time Algorithm for Unique Horn Satisfiability. Inf. Process. Lett. 48(2): 61-66 (1993) - [c1]Daniele Pretolani:
Efficiency and stability of hypergraph SAT algorithms. Cliques, Coloring, and Satisfiability 1993: 479-498
Coauthor Index
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 2025-01-09 13:22 CET 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:
