The following pages link to Daniele Pretolani (Q613475):
Displayed 24 items.
- An aggregate label setting policy for the multi-objective shortest path problem (Q613476) (← links)
- Optimization and probabilistic satisfiability on nested and co-nested formulas (Q646722) (← links)
- Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach (Q744689) (← links)
- Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks (Q833580) (← links)
- The stack loading and unloading problem (Q1003472) (← links)
- A linear time algorithm for unique Horn satisfiability (Q1313762) (← links)
- Efficient labelling algorithms for the maximum noncrossing matching problem (Q1315996) (← links)
- On bandwidth-2 graphs (Q1348371) (← links)
- Hierarchies of polynomially solvable satisfiability problems (Q1380432) (← links)
- Max Horn SAT and the minimum cut problem in directed hypergraphs (Q1380929) (← links)
- Lower bounds for the quadratic semi-assignment problem (Q1388830) (← links)
- A directed hypergraph model for random time dependent shortest paths (Q1569934) (← links)
- Finding the \(K\) shortest hyperpaths (Q1764762) (← links)
- Probability logic and optimization SAT: The PSAT and CPA models (Q1777404) (← links)
- Item:Q613475 (redirect page) (← links)
- A new algorithm for the propositional satisfiability problem (Q1894360) (← links)
- Easy cases of probabilistic satisfiability (Q2349813) (← links)
- Finding hypernetworks in directed hypergraphs (Q2355938) (← links)
- Ranking paths in stochastic time-dependent networks (Q2514742) (← links)
- Shortest paths in piecewise continuous time-dependent networks (Q2517795) (← links)
- Auction Algorithms for Shortest Hyperpath Problems (Q2706320) (← links)
- Bicriterion Shortest Paths in Stochastic Time-Dependent Networks (Q3649590) (← links)
- Theory and Applications of Satisfiability Testing (Q5325876) (← links)
- (Q5687269) (← links)