Pretolani Daniele

Daniele Pretolani

Information about the author Daniele Pretolani will soon be added to the site.
Found 9 papers in total
Optimization and probabilistic satisfiability on nested and co‐nested formulas
Optimization and probabilistic satisfiability on nested and co‐nested formulas
2011
Nested and co‐nested formulas are two classes of CNF instances that can be...
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
2009
We compare two different models for multicriterion routing in stochastic...
Bicriterion shortest hyperpaths in random time-dependent networks
Bicriterion shortest hyperpaths in random time-dependent networks
2003
In relevant application areas, such as transportation and telecommunications, there...
Bicriterion shortest hyperpaths in random time-dependent networks
Bicriterion shortest hyperpaths in random time-dependent networks
2003
In relevant application areas, such as transportation and telecommunications, there...
Finding the K shortest hyperpaths using reoptimization
Finding the K shortest hyperpaths using reoptimization
2006
We present some reoptimization techniques for computing (shortest) hyperpath weights...
Finding the K shortest hyperpaths
Finding the K shortest hyperpaths
2005
The K shortest paths problem has been extensively studied for many years. Efficient...
A directed hypergraph model for random time dependent shortest paths
A directed hypergraph model for random time dependent shortest paths
2000
We consider routing problems in dynamic networks where arc travel times are both...
Lower bounds for the quadratic semi-assignment problem
Lower bounds for the quadratic semi-assignment problem
1995
This paper presents a class of lower bounds for the Quadratic Semi-Assignment Problem...
Efficient labelling algorithms for the maximum noncrossing matching problem
Efficient labelling algorithms for the maximum noncrossing matching problem
1993
Consider a bipartite graph; let’s suppose the origin nodes and the destination...
Papers per page: