default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Silva 0003
Person information
- affiliation: Université d'Avignon et des Pays des Vaucluse, France
Other persons with the same name
- Marco Silva — disambiguation page
- Marco Silva 0001
![[0000-0003-3142-1679]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-3142-1679")
— University of Coimbra, Institute of Systems and Robotics, Portugal - Marco Silva 0002 — Pontifical Catholic University of Rio de Janeiro, Eletrical Engineering Department, Brazil
- Marco Silva 0004 — University of Aveiro, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Marco Silva, João Pedro Pedroso, Ana Viana:
Deep reinforcement learning for stochastic last-mile delivery with crowdshipping. EURO J. Transp. Logist. 12: 100105 (2023)- [j5]Marco Silva, João Pedro Pedroso, Ana Viana:
Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints. Eur. J. Oper. Res. 307(1): 249-265 (2023) - 2022
- [j4]Ayse N. Arslan, Michael Poss, Marco Silva:
Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions. INFORMS J. Comput. 34(4): 2212-2228 (2022) - 2021
- [c2]Marco Silva, João Pedro Pedroso, Ana Viana, Xenia Klimentova:
A Branch-Price-And-Cut Algorithm for Stochastic Crowd Shipping Last-Mile Delivery with Correlated Marginals. ATMOS 2021: 12:1-12:20 - 2020
- [j3]Marco Silva, Michael Poss, Nelson Maculan:
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty. Eur. J. Oper. Res. 283(1): 70-82 (2020)
2010 – 2019
- 2019
- [c1]Marco Silva, Michael Poss:
Distributionally robust airline fleet assignment problem. INOC 2019: 66-71 - 2018
- [b1]Marco Aurelio Costa da Silva:
Applications et algorithmes pour l'optimisation linéaire robuste en deux étapes. (Applications and algorithms for two-stage robust linear optimization). Fluminense Federal University, Rio de Janeiro, Brazil, 2018 - [j2]Marco Silva, Michael Poss, Nelson Maculan:
k-Adaptive Routing for the Robust Network Loading Problem. Electron. Notes Discret. Math. 64: 95-104 (2018) - [j1]Marco Silva, Michael Poss, Nelson Maculan:
Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing. Networks 72(1): 151-170 (2018)
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 2025-01-21 00:21 CET 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:
