Efficiency and stability of hypergraph SAT algorithms. - Daniele Pretolani (Cliques, Coloring, and Satisfiability, 1993)

Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem. - Federico Malucelli; Thomas Ottmann; Daniele Pretolani (Discret. Appl. Math., 1993)

A Linear Time Algorithm for Unique Horn Satisfiability. - Daniele Pretolani (Inf. Process. Lett., 1993)

A New Algorithm for the Propositional Satisfiability Problem. - Giorgio Gallo; Daniele Pretolani (Discret. Appl. Math., 1995)

Hierarchies of Polynomially Solvable Satisfiability Problems. - Daniele Pretolani (Ann. Math. Artif. Intell., 1996)

On Some Path Problems on Oriented Hypergraphs. - S. Nguyen; Daniele Pretolani; Lilian Markenzon (RAIRO Theor. Informatics Appl., 1998)

Max Horn SAT and the minimum cut problem in directed hypergraphs. - Giorgio Gallo; Claudio Gentile; Daniele Pretolani; Gabriella Rago (Math. Program., 1998)

A directed hypergraph model for random time dependent shortest paths. - Daniele Pretolani (Eur. J. Oper. Res., 2000)

Auction Algorithms for Shortest Hyperpath Problems. - Renato De Leone; Daniele Pretolani (SIAM J. Optim., 2000)

Easy Cases of Probabilistic Satisfiability. - Kim Allan Andersen; Daniele Pretolani (Ann. Math. Artif. Intell., 2001)

On bandwidth-2 graphs. - Alberto Caprara; Federico Malucelli; Daniele Pretolani (Discret. Appl. Math., 2002)

Hypergraph Reductions and Satisfiability Problems. - Daniele Pretolani (SAT, 2003)

Probability logic and optimization SAT: The PSAT and CPA models. - Daniele Pretolani (Ann. Math. Artif. Intell., 2005)

Finding the K shortest hyperpaths. - Lars Relund Nielsen; Kim Allan Andersen; Daniele Pretolani (Comput. Oper. Res., 2005)

Finding the K shortest hyperpaths using reoptimization. - Lars Relund Nielsen; Daniele Pretolani; Kim Allan Andersen (Oper. Res. Lett., 2006)

The stack loading and unloading problem. - Federico Malucelli; Stefano Pallottino; Daniele Pretolani (Discret. Appl. Math., 2008)

Shortest paths in piecewise continuous time-dependent networks. - Mauro Dell'Amico; Manuel Iori; Daniele Pretolani (Oper. Res. Lett., 2008)

Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. - Daniele Pretolani; Lars Relund Nielsen; Kim Allan Andersen; Matthias Ehrgott (Oper. Res. Lett., 2009)

An aggregate label setting policy for the multi-objective shortest path problem. - Manuel Iori; Silvano Martello; Daniele Pretolani (Eur. J. Oper. Res., 2010)

Optimization and probabilistic satisfiability on nested and co-nested formulas. - Daniele Pretolani (Ann. Oper. Res., 2011)

Finding hypernetworks in directed hypergraphs. - Daniele Pretolani (Eur. J. Oper. Res., 2013)

Apportionments with minimum Gini index of disproportionality: a Quadratic Knapsack approach. - Daniele Pretolani (Ann. Oper. Res., 2014)

Ranking paths in stochastic time-dependent networks. - Lars Relund Nielsen; Kim Allan Andersen; Daniele Pretolani (Eur. J. Oper. Res., 2014)

A Decision Support System to Evaluate Suppliers in the Context of Global Service Providers. - Bruno Petrato Bruck; Dario Vezzali; Manuel Iori; Carlo Alberto Magni; Daniele Pretolani (ICEIS (1), 2021)

Supplier selection for global service providers: a decision support system. - Bruno Petrato Bruck; Manuel Iori; Carlo Alberto Magni; Daniele Pretolani; Dario Vezzali (INFOR Inf. Syst. Oper. Res., 2025)