Daniele Pretolani - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2021

A Decision Support System to Evaluate Suppliers in the Context of Global Service ProvidersBruno Petrato Bruck, Dario Vezzali, Manuel Iori, Carlo Alberto Magni, Daniele Pretolani. ICEIS 2021: 420-430 [doi]

2014

Ranking paths in stochastic time-dependent networksLars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani. eor, 236(3):903-914, 2014. [doi]

Apportionments with minimum Gini index of disproportionality: a Quadratic Knapsack approachDaniele Pretolani. anor, 215(1):257-267, 2014. [doi]

2013

Finding hypernetworks in directed hypergraphsDaniele Pretolani. eor, 230(2):226-230, 2013. [doi]

2011

Optimization and probabilistic satisfiability on nested and co-nested formulasDaniele Pretolani. anor, 188(1):371-387, 2011. [doi]

2010

An aggregate label setting policy for the multi-objective shortest path problemManuel Iori, Silvano Martello, Daniele Pretolani. eor, 207(3):1489-1496, 2010. [doi]

2009

Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networksDaniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott. orl, 37(3):201-205, 2009. [doi]

2008

The stack loading and unloading problemFederico Malucelli, Stefano Pallottino, Daniele Pretolani. DAM, 156(17):3248-3266, 2008. [doi]

2006

Finding the ::::K:::: shortest hyperpaths using reoptimizationLars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen. orl, 34(2):155-164, 2006. [doi]

2005

Finding the ::::K:::: shortest hyperpathsLars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani. cor, 32:1477-1497, 2005. [doi]

Probability logic and optimization SAT: The PSAT and CPA modelsDaniele Pretolani. AMAI, 43(1):211-221, 2005. [doi]

2003

Hypergraph Reductions and Satisfiability ProblemsDaniele Pretolani. sat 2004: 383-397 [doi]

2002

On bandwidth-2 graphsAlberto Caprara, Federico Malucelli, Daniele Pretolani. DAM, 117(1-3):1-13, 2002.

2001

Easy Cases of Probabilistic SatisfiabilityKim Allan Andersen, Daniele Pretolani. AMAI, 33(1):69-91, 2001.

2000

A directed hypergraph model for random time dependent shortest pathsDaniele Pretolani. eor, 123(2):315-324, 2000. [doi]

1998

Max Horn SAT and the minimum cut problem in directed hypergraphsGiorgio Gallo, Claudio Gentile, Daniele Pretolani, Gabriella Rago. mp, 80:213-237, 1998.

1996

Hierarchies of Polynomially Solvable Satisfiability ProblemsDaniele Pretolani. AMAI, 17(3-4):339-357, 1996.

1995

A New Algorithm for the Propositional Satisfiability ProblemGiorgio Gallo, Daniele Pretolani. DAM, 60(1-3):159-179, 1995. [doi]

1993

Efficient Labelling Algorithms for the Maximum Noncrossing Matching ProblemFederico Malucelli, Thomas Ottmann, Daniele Pretolani. DAM, 47(2):175-179, 1993. [doi]

A Linear Time Algorithm for Unique Horn SatisfiabilityDaniele Pretolani. ipl, 48(2):61-66, 1993.

Efficiency, and stability of hypergraph SAT algorithmsDaniele Pretolani. dimacs 1996: 479-498

Sign in or sign up to see more results.

runs on WebDSL