According to our database1, Stefano Pallottino authored at least 22 papers between 1981 and 2008.
Legend:Book In proceedings Article PhD thesis Other
The stack loading and unloading problem.
Discrete Applied Mathematics, 2008
Route Choice on Transit Networks with Online Information at Stops.
Transportation Science, 2005
A DSS for water resources management under uncertainty by scenario analysis.
Environmental Modelling and Software, 2005
On uniform k-partition problems.
Discrete Applied Mathematics, 2005
Large-scale local search heuristics for the capacitated vertex p-center problem.
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem.
Management Science, 2004
Circular shortest path in images.
Pattern Recognition, 2003
A new algorithm for reoptimizing shortest paths when the arc costs change.
Oper. Res. Lett., 2003
Dynamic shortest paths minimizing travel times and costs.
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights.
Transportation Science, 2002
A Modeling Framework for Passenger Assignment on a Transport Network with Timetables.
Transportation Science, 2001
Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks.
Transportation Science, 1998
Dual algorithms for the shortest path tree problem.
Polynomial auction algorithms for shortest paths.
Comp. Opt. and Appl., 1995
Directed Hypergraphs and Applications.
Discrete Applied Mathematics, 1993
Technical Note - Traffic Equilibrium Paradoxes.
Transportation Science, 1991
Fair dissections of spiders, worms, and caterpillars.
Shortest-path methods: Complexity, interrelations and new propositions.
A new algorithm to find the shortest paths between all pairs of nodes.
Discrete Applied Mathematics, 1982
An Efficient Algorithm for Determining the Length of the Longest Dead Path in a "LIFO" Branch-and-Bound Exploration Schema.
ACM Trans. Math. Softw., 1981
A dual simplex algorithm for finding all shortest paths.