Pallottino Stefano

Stefano Pallottino

Information about the author Stefano Pallottino will soon be added to the site.
Found 16 papers in total
Route choice on transit networks with online information at stops
Route choice on transit networks with online information at stops
2005
Passengers on a transit network with common lines are often faced with the problem of...
Large-scale local search heuristics for the capacitated vertex p-center problem
Large-scale local search heuristics for the capacitated vertex p-center problem
2004
This article investigates the application of very large neighborhood search techniques...
A new algorithm for reoptimizing shortest paths when the arc costs change
A new algorithm for reoptimizing shortest paths when the arc costs change
2003
We propose the first algorithmic approach which reoptimizes the shortest paths when...
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
2002
This paper investigates minimum time and minimum cost path problems in street networks...
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
2002
This paper investigates minimum time and minimum cost path problems in street networks...
Dynamic shortest paths minimizing travel times and costs
Dynamic shortest paths minimizing travel times and costs
2003
In this paper, we study dynamic shortest path problems that determine a shortest path...
A modeling framework for passenger assignment on a transport network with timetables
A modeling framework for passenger assignment on a transport network with timetables
2001
This paper presents a new graph theoretic framework for the passenger assignment...
A modeling framework for passenger assignment on a transport network with timetables
A modeling framework for passenger assignment on a transport network with timetables
2001
This paper presents a new graph theoretic framework for the passenger assignment...
Dual algorithms for the shortest path tree problem
Dual algorithms for the shortest path tree problem
1997
We consider dual approaches for the Shortest Path Tree problem. After a brief...
Regional mass transit assignment with resource constraints
Regional mass transit assignment with resource constraints
1996
This paper considers a mass transit system in a regional area. The problem if...
Directed hypergraphs and applications
Directed hypergraphs and applications
1993
The authors deal with directed hypergraphs as a tool to model some classes of problems...
Experimental effectiveness of Auction Algorithms for the determination of shortest paths
Experimental effectiveness of Auction Algorithms for the determination of shortest paths
1993
Recently many Auction Algorithms have been proposed to find shortest paths in directed...
The maximum flow problem: A max-preflow approach
The maximum flow problem: A max-preflow approach
1991
In the first part of the paper a general maximum flow procedure, which finds a maximum...
Strongly polynomial Auction algorithms for shortest path
Strongly polynomial Auction algorithms for shortest path
1991
An Auction algorithm for shortest paths was recently proposed by Bertsekas. Under the...
Active hyperpaths in transit networks
Active hyperpaths in transit networks
1991
This paper examines several important computational aspects of a recently proposed...
Shortest path algorithms
Shortest path algorithms
1988
The shortest path problem is considered from a computational point of view. Eight...
Papers per page: