- CSB - MetaPress - Google - Bing - Yahoo
 | 2008 | |
|---|---|---|
| j19 |      | Federico Malucelli, Stefano Pallottino, Daniele Pretolani: The stack loading and unloading problem. Discrete Applied Mathematics 156(17): 3248-3266 (2008) |
| 2005 | ||
| j18 | | Paolo Dell'Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi: On uniform k-partition problems. Discrete Applied Mathematics 150(1-3): 121-139 (2005) |
| j17 | | Stefano Pallottino, Giovanni M. Sechi, Paola Zuddas: A DSS for water resources management under uncertainty by scenario analysis. Environmental Modelling and Software 20(8): 1031-1042 (2005) |
| j16 | | Guido Gentile, Sang Nguyen, Stefano Pallottino: Route Choice on Transit Networks with Online Information at Stops. Transportation Science 39(3): 289-297 (2005) |
| 2004 | ||
| j15 | | Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Paola Scaparra, Maria Grazia Scutellà: A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem. Management Science 50(6): 749-760 (2004) |
| j14 | | Maria Paola Scaparra, Stefano Pallottino, Maria Grazia Scutellà: Large-scale local search heuristics for the capacitated vertex p-center problem. Networks 43(4): 241-255 (2004) |
| j13 | | |
| 2003 | ||
| j12 | | Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà: Dynamic shortest paths minimizing travel times and costs. Networks 41(4): 197-205 (2003) |
| j11 | | Stefano Pallottino, Maria Grazia Scutellà: A new algorithm for reoptimizing shortest paths when the arc costs change. Oper. Res. Lett. 31(2): 149-160 (2003) |
| j10 | | Changming Sun, Stefano Pallottino: Circular shortest path in images. Pattern Recognition 36(3): 709-719 (2003) |
| 2002 | ||
| j9 | | Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà: Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights. Transportation Science 36(3): 326-336 (2002) |
| 2001 | ||
| j8 | | Sang Nguyen, Stefano Pallottino, Federico Malucelli: A Modeling Framework for Passenger Assignment on a Transport Network with Timetables. Transportation Science 35(3): 238-249 (2001) |
| 1998 | ||
| j7 | | Sang Nguyen, Stefano Pallottino, Michel Gendreau: Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks. Transportation Science 32(1): 54-64 (1998) |
| 1997 | ||
| j6 | | Stefano Pallottino, Maria Grazia Scutellà: Dual algorithms for the shortest path tree problem. Networks 29(2): 125-133 (1997) |
| 1993 | ||
| j5 | | Giorgio Gallo, Giustino Longo, Stefano Pallottino: Directed Hypergraphs and Applications. Discrete Applied Mathematics 42(2): 177-201 (1993) |
| 1990 | ||
| j4 | | Caterina De Simone, Mario Lucertini, Stefano Pallottino, Bruno Simeone: Fair dissections of spiders, worms, and caterpillars. Networks 20(3): 323-344 (1990) |
| 1984 | ||
| j3 | | Stefano Pallottino: Shortest-path methods: Complexity, interrelations and new propositions. Networks 14(2): 257-267 (1984) |
| 1981 | ||
| j2 | | M. Florian, Sang Nguyen, Stefano Pallottino: A dual simplex algorithm for finding all shortest paths. Networks 11(4): 367-378 (1981) |
| j1 | | Stefano Pallottino, Tommaso Toffoli: An Efficient Algorithm for Determining the Length of the Longest Dead Path in a ``LIFO'' Branch-and-Bound Exploration Schema. ACM Trans. Math. Softw. 7(4): 498-504 (1981) |
Colors in the list of coauthors
Last update Thu May 23 06:20:33 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page