default search action
Alexandre M. Florio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]David S. W. Lai, Yasel Costa, Emrah Demir, Alexandre M. Florio, Tom Van Woensel:
The pollution-routing problem with speed optimization and uneven topography. Comput. Oper. Res. 164: 106557 (2024) - [j11]Sami Serkan Özarik, Paulo da Costa, Alexandre M. Florio:
Machine Learning for Data-Driven Last-Mile Delivery Optimization. Transp. Sci. 58(1): 27-44 (2024) - [i3]Breno Serrano, Alexandre M. Florio, Stefan Minner, Maximilian Schiffer, Thibaut Vidal:
Contextual Stochastic Vehicle Routing with Time Windows. CoRR abs/2402.06968 (2024) - 2023
- [j10]Natasja Sluijk, Alexandre M. Florio, Joris Kinable, Nico P. Dellaert, Tom Van Woensel:
Two-echelon vehicle routing problems: A literature review. Eur. J. Oper. Res. 304(3): 865-886 (2023) - [j9]Jian Zhang, Kelin Luo, Alexandre M. Florio, Tom Van Woensel:
Solving large-scale dynamic vehicle routing problems with stochastic requests. Eur. J. Oper. Res. 306(2): 596-614 (2023) - [j8]Alexandre M. Florio, Michel Gendreau, Richard F. Hartl, Stefan Minner, Thibaut Vidal:
Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut. Eur. J. Oper. Res. 306(3): 1081-1093 (2023) - [j7]Kelin Luo, Alexandre M. Florio, Syamantak Das, Xiangyu Guo:
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem. Proc. VLDB Endow. 16(5): 1195-1207 (2023) - [j6]Natasja Sluijk, Alexandre M. Florio, Joris Kinable, Nico P. Dellaert, Tom Van Woensel:
A Chance-Constrained Two-Echelon Vehicle Routing Problem with Stochastic Demands. Transp. Sci. 57(1): 252-272 (2023) - [c1]Alexandre M. Florio, Pedro Martins, Maximilian Schiffer, Thiago Serra, Thibaut Vidal:
Optimal Decision Diagrams for Classification. AAAI 2023: 7577-7585 - 2022
- [j5]Alexandre M. Florio, Dominique Feillet, Marcus Poggi, Thibaut Vidal:
Vehicle Routing with Stochastic Demands and Partial Reoptimization. Transp. Sci. 56(5): 1393-1408 (2022) - [i2]Alexandre M. Florio, Pedro Martins, Maximilian Schiffer, Thiago Serra, Thibaut Vidal:
Optimal Decision Diagrams for Classification. CoRR abs/2205.14500 (2022) - [i1]Kelin Luo, Alexandre M. Florio, Syamantak Das, Xiangyu Guo:
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem. CoRR abs/2210.05000 (2022) - 2021
- [j4]Alexandre M. Florio, Richard F. Hartl, Stefan Minner, Juan José Salazar González:
A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints. Transp. Sci. 55(1): 122-138 (2021) - [j3]Alexandre M. Florio, Nabil Absi, Dominique Feillet:
Routing Electric Vehicles on Congested Street Networks. Transp. Sci. 55(1): 238-256 (2021) - 2020
- [j2]Alexandre M. Florio, Richard F. Hartl, Stefan Minner:
Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 285(1): 172-182 (2020) - [j1]Alexandre M. Florio, Richard F. Hartl, Stefan Minner:
New Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands. Transp. Sci. 54(4): 1073-1090 (2020)
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-08-03 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint