Stefano Pallottino

According to our database1, Stefano Pallottino authored at least 22 papers between 1981 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2008
The stack loading and unloading problem.
Discrete Applied Mathematics, 2008

2005
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

2004
Large-scale local search heuristics for the capacitated vertex p-center problem.
Networks, 2004

Foreword.
Networks, 2004

A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem.
Management Science, 2004

2003
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.
Networks, 2003

2002
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights.
Transportation Science, 2002

2001
A Modeling Framework for Passenger Assignment on a Transport Network with Timetables.
Transportation Science, 2001

1998
Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks.
Transportation Science, 1998

1997
Dual algorithms for the shortest path tree problem.
Networks, 1997

1995
Polynomial auction algorithms for shortest paths.
Comp. Opt. and Appl., 1995

1993
Directed Hypergraphs and Applications.
Discrete Applied Mathematics, 1993

1991
Technical Note - Traffic Equilibrium Paradoxes.
Transportation Science, 1991

1990
Fair dissections of spiders, worms, and caterpillars.
Networks, 1990

1984
Shortest-path methods: Complexity, interrelations and new propositions.
Networks, 1984

1982
A new algorithm to find the shortest paths between all pairs of nodes.
Discrete Applied Mathematics, 1982

1981
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.
Networks, 1981


  Loading...