Daniele Pretolani

发表

A New Algorithm for the Propositional Satisfiability Problem

Giorgio Gallo, Daniele Pretolani, G. Gallo, 1995, Discret. Appl. Math..

Finding hypernetworks in directed hypergraphs

Daniele Pretolani, 2013, Eur. J. Oper. Res..

Bicriterion shortest hyperpaths in random time‐dependent networks

Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, 2003 .

On Some Path Problems on Oriented Hypergraphs

Daniele Pretolani, Lilian Markenzon, S. Nguyen, 1998, RAIRO Theor. Informatics Appl..

Easy Cases of Probabilistic Satisfiability

Daniele Pretolani, Kim Allan Andersen, D. Pretolani, 2001, Annals of Mathematics and Artificial Intelligence.

The stack loading and unloading problem

Federico Malucelli, Daniele Pretolani, Stefano Pallottino, 2008, Discret. Appl. Math..

On bandwidth-2 graphs

Alberto Caprara, Federico Malucelli, Daniele Pretolani, 2002, Discret. Appl. Math..

Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks

Matthias Ehrgott, Daniele Pretolani, Lars Relund Nielsen, 2009, Oper. Res. Lett..

A COMPUTATIONAL STUDY OF SHORTEST HYPERPATH ALGORITHMS.

Sang Nguyen, Daniele Pretolani, 1995 .

Ranking paths in stochastic time-dependent networks

Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, 2014, Eur. J. Oper. Res..

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

Daniele Pretolani, 2014, Ann. Oper. Res..

A Linear Time Algorithm for Unique Horn Satisfiability

Daniele Pretolani, D. Pretolani, 1993, Inf. Process. Lett..

Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem

Federico Malucelli, Thomas Ottmann, Daniele Pretolani, 1993, Discret. Appl. Math..

Efficiency and stability of hypergraph SAT algorithms

Daniele Pretolani, D. Pretolani, 1993, Cliques, Coloring, and Satisfiability.

Shortest paths in piecewise continuous time-dependent networks

Mauro Dell'Amico, Manuel Iori, Daniele Pretolani, 2008, Oper. Res. Lett..

Hierarchies of polynomially solvable satisfiability problems

Daniele Pretolani, 2005, Annals of Mathematics and Artificial Intelligence.

Optimization and probabilistic satisfiability on nested and co-nested formulas

Daniele Pretolani, D. Pretolani, 2011, Ann. Oper. Res..

Finding the K shortest hyperpaths using reoptimization

Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, 2006, Oper. Res. Lett..

A directed hypergraph model for random time dependent shortest paths

Daniele Pretolani, D. Pretolani, 2000, Eur. J. Oper. Res..

Hypergraph Reductions and Satisfiability Problems

Daniele Pretolani, D. Pretolani, 2003, SAT.

Multiple Criteria Decision Analysis Theory and Tools for the SDEWES Index

Daniele Pretolani, D. Pretolani, 2020 .

Finding the K shortest hyperpaths

Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, 2005, Comput. Oper. Res..

Probability logic and optimization SAT: The PSAT and CPA models

Daniele Pretolani, 2005, Annals of Mathematics and Artificial Intelligence.

Stack loading and unloading problems: an application to rail freight transportation

Federico Malucelli, Daniele Pretolani, Stefano Pallottino, 2003 .

Auction Algorithms for Shortest Hyperpath Problems

Daniele Pretolani, Renato De Leone, D. Pretolani, 2000, SIAM J. Optim..

Max Horn SAT and the minimum cut problem in directed hypergraphs

Claudio Gentile, Giorgio Gallo, Daniele Pretolani, 1998, Math. Program..

Looking at the SDEWES Index from a Multi-Criterion Decision Analysis Perspective

Daniele Pretolani, 2018 .

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

Manuel Iori, Daniele Pretolani, Silvano Martello, 2010, Eur. J. Oper. Res..

A Decision Support System to Evaluate Suppliers in the Context of Global Service Providers

Manuel Iori, Bruno Petrato Bruck, Daniele Pretolani, 2021, ICEIS.

K shortest paths in stochastic time-dependent networks

Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, 2004 .

A note on “Multicriteria adaptive paths in stochastic, time-varying networks”

Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, 2006 .

A remark on the definition of B-hyperpath

Daniele Pretolani, Lars Relund Nielsen, 2001 .

Bicriterion shortest paths in stochastic time-dependent networks

Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, 2009 .

Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks

Matthias Ehrgott, Daniele Pretolani, Lars Relund Nielsen, 2008 .

Bicriterion a priori route choice in stochastic time-dependent networks

Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, 2006 .

Quadratic Semi-Assignment Problems on Structured Graphs

Federico Malucelli, Daniele Pretolani, 1994 .