Stefano Pallottino

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

The stack loading and unloading problem.

Federico Malucelli, Stefano Pallottino, Daniele Pretolani

Discret. Appl. Math., 2008

2005

Route Choice on Transit Networks with Online Information at Stops.

Guido Gentile, Sang Nguyen, Stefano Pallottino

Transp. Sci., 2005

A DSS for water resources management under uncertainty by scenario analysis.

Stefano Pallottino, Giovanni M. Sechi, Paola Zuddas

Environ. Model. Softw., 2005

On uniform <i>k</i>-partition problems.

Paolo Dell'Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi

Discret. Appl. Math., 2005

2004

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

Maria Paola Scaparra, Stefano Pallottino, Maria Grazia Scutellà

Networks, 2004

Foreword.

Stefano Pallottino, Roberto Tadei

Networks, 2004

A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem.

Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Paola Scaparra, Maria Grazia Scutellà

Manag. Sci., 2004

2003

Circular shortest path in images.

Changming Sun, Stefano Pallottino

Pattern Recognit., 2003

A new algorithm for reoptimizing shortest paths when the arc costs change.

Stefano Pallottino, Maria Grazia Scutellà

Oper. Res. Lett., 2003

Dynamic shortest paths minimizing travel times and costs.

Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà

Networks, 2003

2002

Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights.

Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà

Transp. Sci., 2002

2001

A Modeling Framework for Passenger Assignment on a Transport Network with Timetables.

Sang Nguyen, Stefano Pallottino, Federico Malucelli

Transp. Sci., 2001

1998

Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks.

Sang Nguyen, Stefano Pallottino, Michel Gendreau

Transp. Sci., 1998

1997

Dual algorithms for the shortest path tree problem.

Stefano Pallottino, Maria Grazia Scutellà

Networks, 1997

1995

Polynomial auction algorithms for shortest paths.

Dimitri P. Bertsekas, Stefano Pallottino, Maria Grazia Scutellà

Comput. Optim. Appl., 1995

1993

Directed Hypergraphs and Applications.

Giorgio Gallo, Giustino Longo, Stefano Pallottino

Discret. Appl. Math., 1993

1991

Technical Note - Traffic Equilibrium Paradoxes.

Stefano Catoni, Stefano Pallottino

Transp. Sci., 1991

1990

Fair dissections of spiders, worms, and caterpillars.

Caterina De Simone, Mario Lucertini, Stefano Pallottino, Bruno Simeone

Networks, 1990

1984

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

Stefano Pallottino

Networks, 1984

1982

A new algorithm to find the shortest paths between all pairs of nodes.

Giorgio Gallo, Stefano Pallottino

Discret. Appl. Math., 1982

1981

An Efficient Algorithm for Determining the Length of the Longest Dead Path in a "LIFO" Branch-and-Bound Exploration Schema.

Stefano Pallottino, Tommaso Toffoli

ACM Trans. Math. Softw., 1981

A dual simplex algorithm for finding all shortest paths.

Michael Florian, Sang Nguyen, Stefano Pallottino

Networks, 1981