Stefano Pallottino - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2008

The stack loading and unloading problemFederico Malucelli, Stefano Pallottino, Daniele Pretolani. DAM, 156(17):3248-3266, 2008. [doi]

2005

Route Choice on Transit Networks with Online Information at StopsGuido Gentile, Sang Nguyen, Stefano Pallottino. transci, 39(3):289-297, 2005. [doi]

On uniform ::::k::::-partition problemsPaolo Dell Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi. DAM, 150(1-3):121-139, 2005. [doi]

A DSS for water resources management under uncertainty by scenario analysisStefano Pallottino, Giovanni M. Sechi, Paola Zuddas. envsoft, 20(8):1031-1042, 2005. [doi]

2004

A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location ProblemRavindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Paola Scaparra, Maria Grazia ScutellÃ . mansci, 50(6):749-760, 2004. [doi]

ForewordStefano Pallottino, Roberto Tadei. networks, 44(2):59-60, 2004. [doi]

Large-scale local search heuristics for the capacitated vertex p-center problemMaria Paola Scaparra, Stefano Pallottino, Maria Grazia Scutellà. networks, 43(4):241-255, 2004. [doi]

2003

Dynamic shortest paths minimizing travel times and costsRavindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà. networks, 41(4):197-205, 2003. [doi]

A new algorithm for reoptimizing shortest paths when the arc costs changeStefano Pallottino, Maria Grazia Scutellà. orl, 31(2):149-160, 2003. [doi]

Circular shortest path in imagesChangming Sun, Stefano Pallottino. PR, 36(3):709-719, 2003. [doi]

2002

Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic LightsRavindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia ScutellÃ . transci, 36(3):326-336, 2002. [doi]

2001

A Modeling Framework for Passenger Assignment on a Transport Network with TimetablesSang Nguyen, Stefano Pallottino, Federico Malucelli. transci, 35(3):238-249, 2001. [doi]

1998

Implicit Enumeration of Hyperpaths in a Logit Model for Transit NetworksSang Nguyen, Stefano Pallottino, Michel Gendreau. transci, 32(1):54-64, 1998. [doi]

1997

Dual algorithms for the shortest path tree problemStefano Pallottino, Maria Grazia Scutellà. networks, 29(2):125-133, 1997. [doi]

1995

Polynomial auction algorithms for shortest pathsDimitri P. Bertsekas, Stefano Pallottino, Maria Grazia Scutellà. coap, 4(2):99-125, 1995. [doi]

1993

Directed Hypergraphs and ApplicationsGiorgio Gallo, Giustino Longo, Stefano Pallottino. DAM, 42(2):177-201, 1993. [doi]

1991

Technical Note - Traffic Equilibrium ParadoxesStefano Catoni, Stefano Pallottino. transci, 25(3):240-244, 1991. [doi]

1990

Fair dissections of spiders, worms, and caterpillarsCaterina De Simone, Mario Lucertini, Stefano Pallottino, Bruno Simeone. networks, 20(3):323-344, 1990. [doi]

1984

Shortest-path methods: Complexity, interrelations and new propositionsStefano Pallottino. networks, 14(2):257-267, 1984. [doi]

1982

A new algorithm to find the shortest paths between all pairs of nodesGiorgio Gallo, Stefano Pallottino. DAM, 4(1):23-35, 1982. [doi]

1981

A dual simplex algorithm for finding all shortest pathsM. Florian, Sang Nguyen, Stefano Pallottino. networks, 11(4):367-378, 1981. [doi]

An Efficient Algorithm for Determining the Length of the Longest Dead Path in a LIFO Branch-and-Bound Exploration SchemaStefano Pallottino, Tommaso Toffoli. TOMS, 7(4):498-504, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL