Daniele Pretolani

25 papers A 1Journal 22Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Supplier selection for global service providers: a decision support system.
INFOR Inf. Syst. Oper. Res.
Bruno Petrato Bruck, Manuel Iori, Carlo Alberto Magni, Daniele Pretolani, Dario Vezzali
2021 — conf
A Decision Support System to Evaluate Suppliers in the Context of Global Service Providers.
ICEIS (1)
Bruno Petrato Bruck, Dario Vezzali, Manuel Iori, Carlo Alberto Magni, Daniele Pretolani
2014 J jnl
Apportionments with minimum Gini index of disproportionality: a Quadratic Knapsack approach.
Ann. Oper. Res.
Daniele Pretolani
2014 J jnl
Ranking paths in stochastic time-dependent networks.
Eur. J. Oper. Res.
Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani
2013 J jnl
Finding hypernetworks in directed hypergraphs.
Eur. J. Oper. Res.
Daniele Pretolani
2011 J jnl
Optimization and probabilistic satisfiability on nested and co-nested formulas.
Ann. Oper. Res.
Daniele Pretolani
2010 J jnl
An aggregate label setting policy for the multi-objective shortest path problem.
Eur. J. Oper. Res.
Manuel Iori, Silvano Martello, Daniele Pretolani
2009 J jnl
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks.
Oper. Res. Lett.
Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott
2008 J jnl
Shortest paths in piecewise continuous time-dependent networks.
Oper. Res. Lett.
Mauro Dell'Amico, Manuel Iori, Daniele Pretolani
2008 J jnl
The stack loading and unloading problem.
Discret. Appl. Math.
Federico Malucelli, Stefano Pallottino, Daniele Pretolani
2006 J jnl
Finding the
Oper. Res. Lett.
Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen
2005 J jnl
Finding the
Comput. Oper. Res.
Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani
2005 J jnl
Probability logic and optimization SAT: The PSAT and CPA models.
Ann. Math. Artif. Intell.
Daniele Pretolani
2003 A conf
Hypergraph Reductions and Satisfiability Problems.
SAT
Daniele Pretolani
2002 J jnl
On bandwidth-2 graphs.
Discret. Appl. Math.
Alberto Caprara, Federico Malucelli, Daniele Pretolani
2001 J jnl
Easy Cases of Probabilistic Satisfiability.
Ann. Math. Artif. Intell.
Kim Allan Andersen, Daniele Pretolani
2000 J jnl
A directed hypergraph model for random time dependent shortest paths.
Eur. J. Oper. Res.
Daniele Pretolani
2000 J jnl
Auction Algorithms for Shortest Hyperpath Problems.
SIAM J. Optim.
Renato De Leone, Daniele Pretolani
1998 J jnl
Max Horn SAT and the minimum cut problem in directed hypergraphs.
Math. Program.
Giorgio Gallo, Claudio Gentile, Daniele Pretolani, Gabriella Rago
1998 J jnl
On Some Path Problems on Oriented Hypergraphs.
RAIRO Theor. Informatics Appl.
S. Nguyen, Daniele Pretolani, Lilian Markenzon
1996 J jnl
Hierarchies of Polynomially Solvable Satisfiability Problems.
Ann. Math. Artif. Intell.
Daniele Pretolani
1995 J jnl
A New Algorithm for the Propositional Satisfiability Problem.
Discret. Appl. Math.
Giorgio Gallo, Daniele Pretolani
1993 J jnl
A Linear Time Algorithm for Unique Horn Satisfiability.
Inf. Process. Lett.
Daniele Pretolani
1993 — conf
Efficiency and stability of hypergraph SAT algorithms.
Cliques, Coloring, and Satisfiability
Daniele Pretolani
1993 J jnl
Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem.
Discret. Appl. Math.
Federico Malucelli, Thomas Ottmann, Daniele Pretolani