default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefano Pallottino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j22]Federico Malucelli
, Stefano Pallottino, Daniele Pretolani:
The stack loading and unloading problem. Discret. Appl. Math. 156(17): 3248-3266 (2008)- 2005
- [j21]Paolo Dell'Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi:
On uniform k-partition problems. Discret. Appl. Math. 150(1-3): 121-139 (2005) - [j20]Stefano Pallottino, Giovanni M. Sechi, Paola Zuddas:
A DSS for water resources management under uncertainty by scenario analysis. Environ. Model. Softw. 20(8): 1031-1042 (2005) - [j19]Guido Gentile, Sang Nguyen, Stefano Pallottino:
Route Choice on Transit Networks with Online Information at Stops. Transp. Sci. 39(3): 289-297 (2005) - 2004
- [j18]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. Manag. Sci. 50(6): 749-760 (2004) - [j17]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) - [j16]Stefano Pallottino, Roberto Tadei:
Foreword. Networks 44(2): 59-60 (2004) - 2003
- [j15]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) - [j14]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) - [j13]Changming Sun, Stefano Pallottino:
Circular shortest path in images. Pattern Recognit. 36(3): 709-719 (2003) - 2002
- [j12]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. Transp. Sci. 36(3): 326-336 (2002) - 2001
- [j11]Sang Nguyen, Stefano Pallottino, Federico Malucelli:
A Modeling Framework for Passenger Assignment on a Transport Network with Timetables. Transp. Sci. 35(3): 238-249 (2001)
1990 – 1999
- 1998
- [j10]Sang Nguyen, Stefano Pallottino, Michel Gendreau:
Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks. Transp. Sci. 32(1): 54-64 (1998) - 1997
- [j9]Stefano Pallottino, Maria Grazia Scutellà:
Dual algorithms for the shortest path tree problem. Networks 29(2): 125-133 (1997) - 1995
- [j8]Dimitri P. Bertsekas, Stefano Pallottino, Maria Grazia Scutellà:
Polynomial auction algorithms for shortest paths. Comput. Optim. Appl. 4(2): 99-125 (1995) - 1993
- [j7]Giorgio Gallo, Giustino Longo, Stefano Pallottino:
Directed Hypergraphs and Applications. Discret. Appl. Math. 42(2): 177-201 (1993) - 1991
- [j6]Stefano Catoni, Stefano Pallottino:
Technical Note - Traffic Equilibrium Paradoxes. Transp. Sci. 25(3): 240-244 (1991) - 1990
- [j5]Caterina De Simone, Mario Lucertini, Stefano Pallottino, Bruno Simeone:
Fair dissections of spiders, worms, and caterpillars. Networks 20(3): 323-344 (1990)
1980 – 1989
- 1984
- [j4]Stefano Pallottino:
Shortest-path methods: Complexity, interrelations and new propositions. Networks 14(2): 257-267 (1984) - 1982
- [j3]Giorgio Gallo, Stefano Pallottino:
A new algorithm to find the shortest paths between all pairs of nodes. Discret. Appl. Math. 4(1): 23-35 (1982) - 1981
- [j2]Michael 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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
