default search action
Paola Zuddas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j14]Ali Ghezelsoflu, Massimo Di Francesco, Antonio Frangioni, Paola Zuddas:
A multiperiod drayage problem with customer-dependent service periods. Comput. Oper. Res. 129: 105189 (2021) - [j13]Massimo Di Francesco
, Enrico Gorgone
Preface: Special issue on freight transportation and logistics. Networks 78(1): 3-4 (2021)
2010 – 2019
- 2019
- [j12]Massimo Di Francesco, Claudio Gentile, Silvia Schirra, Giuseppe Stecca
An integral LP relaxation for a drayage problem. Discret. Optim. 31: 93-102 (2019) - [j11]Massimo Di Francesco
The forwarder planning problem in a two-echelon network. Networks 74(4): 351-359 (2019) - 2018
- [j10]Simone Zanda, Paola Zuddas
Long term nurse scheduling via a decision support system based on linear integer programming: A case study at the University Hospital in Cagliari. Comput. Ind. Eng. 126: 337-347 (2018) - [j9]Ali Ghezelsoflu, Massimo Di Francesco, Paola Zuddas, Antonio Frangioni
A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks. Electron. Notes Discret. Math. 69: 237-244 (2018) - 2016
- [j8]Massimo Di Francesco, Nuria Díaz-Maroto Llorente, Simone Zanda, Paola Zuddas:
An optimization model for the short-term manpower planning problem in transhipment container terminals. Comput. Ind. Eng. 97: 183-190 (2016) - 2015
- [j7]Michela Lai, Maria Battarra
An adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls. J. Oper. Res. Soc. 66(7): 1222-1235 (2015) - [j6]Michela Lai, Maria Battarra, Massimo Di Francesco, Paola Zuddas:
An adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls. J. Oper. Res. Soc. 66(7): 1236 (2015) - 2013
- [j5]Massimo Di Francesco
Maritime repositioning of empty containers under uncertain port disruptions. Comput. Ind. Eng. 64(3): 827-837 (2013) - 2012
- [j4]Alexei A. Gaivoronski, Giovanni M. Sechi
Cost/risk balanced management of scarce resources using stochastic programming. Eur. J. Oper. Res. 216(1): 214-224 (2012) - [c2]Michela Lai, Massimo Di Francesco, Paola Zuddas:
Heuristics for the routing of trucks with double container loads. SCOR 2012: 84-93 - 2011
- [j3]Davide Cherubini, Alessandra Fanni
Linear programming models for traffic engineering in 100% survivable networks under combined IS-IS/OSPF and MPLS-TE. Comput. Oper. Res. 38(12): 1805-1815 (2011) - 2010
- [c1]Giovanni M. Sechi, R. Zucca, Paola Zuddas:
The Water Pricing Problem in a Complex Water Resources System: A Cooperative Game Theory Approach. OR 2010: 511-516
2000 – 2009
- 2007
- [j2]Massimiliano Errico
A deterministic algorithm for the synthesis of maximum energy recovery heat exchanger network. Comput. Chem. Eng. 31(7): 773-781 (2007) - 2005
- [j1]Stefano Pallottino, Giovanni M. Sechi
A DSS for water resources management under uncertainty by scenario analysis. Environ. Model. Softw. 20(8): 1031-1042 (2005)
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-26 18:25 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: