default search action
Fausto Errico
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Mohsen Dastpak
, Fausto Errico, Ola Jabali:
Off-line approximate dynamic programming for the vehicle routing problem with a highly variable customer basis and stochastic demands. Comput. Oper. Res. 159: 106338 (2023) - [j10]Borzou Rostami
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs. Oper. Res. 71(2): 471-486 (2023) - [j9]Clément Altman, Guy Desaulniers
The Fragility-Constrained Vehicle Routing Problem with Time Windows. Transp. Sci. 57(2): 552-572 (2023) - [i3]Mohsen Dastpak, Fausto Errico, Ola Jabali, Federico Malucelli:
Dynamic Routing for the Electric Vehicle Shortest Path Problem with Charging Station Occupancy Information. CoRR abs/2305.11773 (2023) - 2021
- [j8]Borzou Rostami
Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times. Oper. Res. 69(2): 436-455 (2021) - [j7]Fausto Errico
The Single-Line Design Problem for Demand-Adaptive Transit Systems: A Modeling Framework and Decomposition Approach for the Stationary-Demand Case. Transp. Sci. 55(6): 1300-1321 (2021) - [i2]Paul Dixneuf, Fausto Errico, Mathias Glaus:
A computational study on imputation methods for missing environmental data. CoRR abs/2108.09500 (2021) - [i1]Mohsen Dastpak, Fausto Errico:
Off-line approximate dynamic programming for the vehicle routing problem with stochastic customers and demands via decentralized decision-making. CoRR abs/2109.10200 (2021)
2010 – 2019
- 2018
- [j6]Fausto Errico, Guy Desaulniers, Michel Gendreau, Walter Rei, Louis-Martin Rousseau:
The vehicle routing problem with hard time windows and stochastic service times. EURO J. Transp. Logist. 7(3): 223-251 (2018) - 2017
- [j5]Fausto Errico, Teodor Gabriel Crainic, Federico Malucelli, Maddalena Nonato:
A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems. Transp. Sci. 51(2): 706-722 (2017) - 2016
- [j4]Fausto Errico, Guy Desaulniers
A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. Eur. J. Oper. Res. 249(1): 55-66 (2016) - [j3]Guy Desaulniers
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows. Oper. Res. 64(6): 1388-1405 (2016) - [j2]Teodor Gabriel Crainic, Fausto Errico, Walter Rei, Nicoletta Ricciardi:
Modeling Demand Uncertainty in Two-Tier City Logistics Tactical Planning. Transp. Sci. 50(2): 559-578 (2016) - 2012
- [j1]Teodor Gabriel Crainic
Designing the master schedule for demand-adaptive transit systems. Ann. Oper. Res. 194(1): 151-166 (2012)
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-25 05:52 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: