Stefano Pallottino

发表

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

Tommaso Toffoli, Stefano Pallottino, 1981, TOMS.

Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks

Michel Gendreau, Sang Nguyen, Stefano Pallottino, 1992, Transp. Sci..

A dual simplex algorithm for finding all shortest paths

Sang Nguyen, M. Florian, Stefano Pallottino, 1981, Networks.

Directed Hypergraphs and Applications

Giorgio Gallo, Stefano Pallottino, Giustino Longo, 1993, Discret. Appl. Math..

Revisione del volume "Annotated Bibliographies in Combinatorial Optimization" (Dell'Amico, Maffioli, Martello Eds.)

Stefano Pallottino, Maria Grazia Scutella, 1997 .

BEHAVIORAL PATTERNS AND ATTRACTIVE SETS IN STOCHASTIC MODELS FOR TRANSIT NETWORKS..

Stefano Pallottino, Pietro Paiano, 1997 .

TRAFFIC ASSIGNMENT FOR LARGE SCALE TRANSIT NETWORKS

Sang Nguyen, Stefano Pallottino, 1987 .

On uniform k-partition problems

Pierre Hansen, Paolo Dell'Olmo, Stefano Pallottino, 2005, Discret. Appl. Math..

The stack loading and unloading problem

Federico Malucelli, Daniele Pretolani, Stefano Pallottino, 2008, Discret. Appl. Math..

Circular shortest path in images

Changming Sun, Stefano Pallottino, Changming Sun, 2003, Pattern Recognit..

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

Maria Grazia Scutellà, Ravindra K. Ahuja, James B. Orlin, 2002, Transp. Sci..

Regional mass transit assignment with resource constraints

Federico Malucelli, Stefano Pallottino, P. Carraresi, 1996 .

Sloan School of Management Working Paper 4387-02 October 2002 A MULTI-EXCHANGE HEURISTIC FOR THE SINGLE SOURCE CAPACITATED FACILITY LOCATION PROBLEM

Maria Paola Scaparra, Maria Grazia Scutellà, Ravindra K. Ahuja, 2002 .

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

Federico Malucelli, Sang Nguyen, Stefano Pallottino, 1998, Transp. Sci..

Shortest path algorithms

Giorgio Gallo, Stefano Pallottino, G. Gallo, 1988, Handbook of Optimization in Telecommunications.

Polynomial auction algorithms for shortest paths

Dimitri P. Bertsekas, Maria Grazia Scutellà, Stefano Pallottino, 1995, Comput. Optim. Appl..

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

Giorgio Gallo, Stefano Pallottino, G. Gallo, 1982, Discret. Appl. Math..

Demand Adaptive Systems: Some Proposals on Flexible Transit1

Federico Malucelli, Maddalena Nonato, Stefano Pallottino, 1999 .

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

Maria Paola Scaparra, Maria Grazia Scutellà, Stefano Pallottino, 2004, Networks.

A DSS for water resources management under uncertainty by scenario analysis

Stefano Pallottino, Paola Zuddas, Giovanni M. Sechi, 2005, Environ. Model. Softw..

Equilibrium traffic assignment for large scale transit networks

Stefano Pallottino, Sang Nguyen, S. Pallottino, 1988 .

Rethinking the wait model at transit stops

Sang Nguyen, Guido Gentile, Stefano Pallottino, 2004 .

Shortest-path methods: Complexity, interrelations and new propositions

Stefano Pallottino, S. Pallottino, 1984, Networks.

Technical Note - Traffic Equilibrium Paradoxes

Stefano Pallottino, Stefano Catoni, 1991, Transp. Sci..

Fair dissections of spiders, worms, and caterpillars

Caterina De Simone, Bruno Simeone, Stefano Pallottino, 1990, Networks.

Reoptimization algorithms for minimum-time problems in dynamic networks

Maria Grazia Scutellà, Stefano Pallottino, I. Chabini, 2001 .

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

Maria Grazia Scutellà, Stefano Pallottino, 2003, Oper. Res. Lett..

Dual algorithms for the shortest path tree problem

Maria Grazia Scutellà, Stefano Pallottino, S. Pallottino, 1996, Networks.

On the regional mass transit assignment problem

Federico Malucelli, Stefano Pallottino, P. Carraresi, 1995 .

Route Choice on Transit Networks with Online Information at Stops

Sang Nguyen, Guido Gentile, Stefano Pallottino, 2005, Transp. Sci..

Stack loading and unloading problems: an application to rail freight transportation

Federico Malucelli, Daniele Pretolani, Stefano Pallottino, 2003 .

Strongly polynomial auction algorithms for shortest paths

Maria Grazia Scutellà, Stefano Pallottino, 1991 .

Dynamic shortest paths minimizing travel times and costs

Maria Grazia Scutellà, Ravindra K. Ahuja, James B. Orlin, 2001, Networks.

Dual Algorithms for the Shortest Path Tree Problem

Maria Grazia Scutellà, Stefano Pallottino, S. Pallottino, 1996 .

Hypergraph models and algorithms for the assembly problem

Giorgio Gallo, Stefano Pallottino, 1992 .