default search action
Rafael Martinelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j16]Tat Dat Nguyen
, Rafael Martinelli
The set team orienteering problem. Eur. J. Oper. Res. 321(1): 75-87 (2025) - 2023
- [j15]Victor Abu-Marrul
Simheuristic algorithm for a stochastic parallel machine scheduling problem with periodic re-planning assessment. Ann. Oper. Res. 320(2): 547-572 (2023) - [j14]Toni Pacheco, Rafael Martinelli
Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem. Transp. Sci. 57(2): 463-481 (2023) - [j13]Axel Parmentier
Electric Vehicle Fleets: Scalable Route and Recharge Scheduling Through Column Generation. Transp. Sci. 57(3): 631-646 (2023) - 2022
- [j12]Davi Mecler
Iterated greedy algorithms for a complex parallel machine scheduling problem. Eur. J. Oper. Res. 300(2): 545-560 (2022) - [c5]Letícia Caldas
Solving a School Bus Routing Problem in Rural Areas: An Application in Brazil. ICCL 2022: 162-176 - 2021
- [j11]Victor Abu-Marrul
Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: Application in the offshore oil and gas industry. Comput. Oper. Res. 128: 105162 (2021) - [j10]Victor Abu-Marrul
Scheduling pipe laying support vessels with non-anticipatory family setup times and intersections between sets of operations. Int. J. Prod. Res. 59(22): 6833-6847 (2021) - [j9]Thibaut Vidal
Arc Routing with Time-Dependent Travel Times and Paths. Transp. Sci. 55(3): 706-724 (2021) - [c4]Lucas Louzada
Solving a Real-Life Tramp Ship Routing and Scheduling Problem with Speed Profiles. ICCL 2021: 82-96 - [c3]Nathalie Sanghikian
A Hybrid VNS for the Multi-product Maritime Inventory Routing Problem. ICVNS 2021: 111-122 - [i4]João Vilela, Bruno Fanzeres, Rafael Martinelli, Claudio Contardo:
Efficient labeling algorithms for adjacent quadratic shortest paths. CoRR abs/2112.04045 (2021) - 2020
- [j8]Gabriel Homsi
Industrial and tramp ship routing problems: Closing the gap for real-scale instances. Eur. J. Oper. Res. 283(3): 972-990 (2020) - [c2]Pedro Diniz
An Efficient Matheuristic for the Inventory Routing Problem. ISCO 2020: 273-285 - [i3]Thibaut Vidal, Rafael Martinelli, Tuan Anh Pham, Minh Hoàng Hà:
Arc Routing with Time-Dependent Travel Times and Paths. CoRR abs/2004.14473 (2020)
2010 – 2019
- 2018
- [j7]Teobaldo Bulhões
The vehicle routing problem with service level constraints. Eur. J. Oper. Res. 265(2): 544-558 (2018) - [j6]Matheus Nohra Haddad
Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads. Eur. J. Oper. Res. 270(3): 1014-1027 (2018) - [j5]Leonardo Fontoura, Rafael Martinelli
The minimum distance superset problem: formulations and algorithms. J. Glob. Optim. 72(1): 27-53 (2018) - [i2]Matheus Nohra Haddad, Rafael Martinelli, Thibaut Vidal, Luiz Satoru Ochi, Simone L. Martins, Marcone Jamilson Freitas Souza, Richard F. Hartl:
Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads. CoRR abs/1802.06318 (2018) - [i1]Gabriel Homsi, Rafael Martinelli, Thibaut Vidal, Kjetil Fagerholt:
Industrial and Tramp Ship Routing Problems: Closing the Gap for Real-Scale Instances. CoRR abs/1809.10584 (2018) - 2015
- [j4]Rafael Martinelli
Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure. INFORMS J. Comput. 27(4): 658-676 (2015) - 2014
- [j3]Claudio Contardo
A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discret. Optim. 12: 129-146 (2014) - [j2]Rafael Martinelli
Efficient elementary and restricted non-elementary route pricing. Eur. J. Oper. Res. 239(1): 102-111 (2014) - 2013
- [j1]Rafael Martinelli
Improved bounds for large scale capacitated arc routing problem. Comput. Oper. Res. 40(8): 2145-2160 (2013) - 2011
- [c1]Rafael Martinelli
A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem. SEA 2011: 315-326
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-12-23 19:34 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: