Daniele Pretolani

According to our database, Daniele Pretolani authored at least 25 papers between 1993 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

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., January, 2025

2021

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

Proceedings of the 23rd International Conference on Enterprise Information Systems, 2021

2014

Ranking paths in stochastic time-dependent networks.

Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani

Eur. J. Oper. Res., 2014

Apportionments with minimum Gini index of disproportionality: a Quadratic Knapsack approach.

Daniele Pretolani

Ann. Oper. Res., 2014

2013

Finding hypernetworks in directed hypergraphs.

Daniele Pretolani

Eur. J. Oper. Res., 2013

2011

Optimization and probabilistic satisfiability on nested and co-nested formulas.

Daniele Pretolani

Ann. Oper. Res., 2011

2010

An aggregate label setting policy for the multi-objective shortest path problem.

Manuel Iori, Silvano Martello, Daniele Pretolani

Eur. J. Oper. Res., 2010

2009

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

2008

Shortest paths in piecewise continuous time-dependent networks.

Mauro Dell'Amico, Manuel Iori, Daniele Pretolani

Oper. Res. Lett., 2008

The stack loading and unloading problem.

Federico Malucelli, Stefano Pallottino, Daniele Pretolani

Discret. Appl. Math., 2008

2006

Finding the <i>K</i> shortest hyperpaths using reoptimization.

Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen

Oper. Res. Lett., 2006

2005

Finding the <i>K</i> shortest hyperpaths.

Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani

Comput. Oper. Res., 2005

Probability logic and optimization SAT: The PSAT and CPA models.

Daniele Pretolani

Ann. Math. Artif. Intell., 2005

2003

Hypergraph Reductions and Satisfiability Problems.

Daniele Pretolani

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002

On bandwidth-2 graphs.

Alberto Caprara, Federico Malucelli, Daniele Pretolani

Discret. Appl. Math., 2002

2001

Easy Cases of Probabilistic Satisfiability.

Kim Allan Andersen, Daniele Pretolani

Ann. Math. Artif. Intell., 2001

2000

Auction Algorithms for Shortest Hyperpath Problems.

Renato De Leone, Daniele Pretolani

SIAM J. Optim., 2000

A directed hypergraph model for random time dependent shortest paths.

Daniele Pretolani

Eur. J. Oper. Res., 2000

1998

Max Horn SAT and the minimum cut problem in directed hypergraphs.

Giorgio Gallo, Claudio Gentile, Daniele Pretolani, Gabriella Rago

Math. Program., 1998

On Some Path Problems on Oriented Hypergraphs.

S. Nguyen, Daniele Pretolani, Lilian Markenzon

RAIRO Theor. Informatics Appl., 1998

1996

Hierarchies of Polynomially Solvable Satisfiability Problems.

Daniele Pretolani

Ann. Math. Artif. Intell., 1996

1995

A New Algorithm for the Propositional Satisfiability Problem.

Giorgio Gallo, Daniele Pretolani

Discret. Appl. Math., 1995

1993

A Linear Time Algorithm for Unique Horn Satisfiability.

Daniele Pretolani

Inf. Process. Lett., 1993

Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem.

Federico Malucelli, Thomas Ottmann, Daniele Pretolani

Discret. Appl. Math., 1993

Efficiency and stability of hypergraph SAT algorithms.

Daniele Pretolani

Proceedings of the Cliques, 1993