Rafael Martinelli

28 papers B 1C 1Journal 23Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A heuristic algorithm based on beam search and iterated local search for the maritime inventory routing problem. Comput. Oper. Res. Nathalie Sanghikian, Rafael Meirelles, Anand Subramanian, Rafael Martinelli
2026	J	`jnl`	A hybrid genetic search for the inventory routing problem. Comput. Oper. Res. Bruno Castro, Marcus Poggi, Rafael Martinelli
2025	J	`jnl`	A Heuristic Algorithm Based on Beam Search and Iterated Local Search for the Maritime Inventory Routing Problem. CoRR Nathalie Sanghikian, Rafael Meirelles, Rafael Martinelli, Anand Subramanian
2025	J	`jnl`	The set team orienteering problem. Eur. J. Oper. Res. Tat Dat Nguyen, Rafael Martinelli, Quang Anh Pham, Minh Hoàng Hà
2023	J	`jnl`	Electric Vehicle Fleets: Scalable Route and Recharge Scheduling Through Column Generation. Transp. Sci. Axel Parmentier, Rafael Martinelli, Thibaut Vidal
2023	J	`jnl`	Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem. Transp. Sci. Toni Pacheco, Rafael Martinelli, Anand Subramanian, Túlio A. M. Toffolo, Thibaut Vidal
2023	J	`jnl`	Simheuristic algorithm for a stochastic parallel machine scheduling problem with periodic re-planning assessment. Ann. Oper. Res. Victor Abu-Marrul, Rafael Martinelli, Silvio Hamacher, Irina V. Gribkovskaia
2022	J	`jnl`	Iterated greedy algorithms for a complex parallel machine scheduling problem. Eur. J. Oper. Res. Davi Mecler, Victor Abu-Marrul, Rafael Martinelli, Arild Hoff
2022	—	`conf`	Solving a School Bus Routing Problem in Rural Areas: An Application in Brazil. ICCL Letícia Caldas, Rafael Martinelli, Bruno Rosa
2021	—	`conf`	A Hybrid VNS for the Multi-product Maritime Inventory Routing Problem. ICVNS Nathalie Sanghikian, Rafael Martinelli, Victor Abu-Marrul
2021	J	`jnl`	Arc Routing with Time-Dependent Travel Times and Paths. Transp. Sci. Thibaut Vidal, Rafael Martinelli, Tuan Anh Pham, Minh Hoàng Hà
2021	J	`jnl`	Efficient labeling algorithms for adjacent quadratic shortest paths. CoRR João Vilela, Bruno Fanzeres, Rafael Martinelli, Claudio Contardo
2021	J	`jnl`	Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: Application in the offshore oil and gas industry. Comput. Oper. Res. Victor Abu-Marrul, Rafael Martinelli, Silvio Hamacher, Irina V. Gribkovskaia
2021	J	`jnl`	Scheduling pipe laying support vessels with non-anticipatory family setup times and intersections between sets of operations. Int. J. Prod. Res. Victor Abu-Marrul, Rafael Martinelli, Silvio Hamacher
2021	—	`conf`	Solving a Real-Life Tramp Ship Routing and Scheduling Problem with Speed Profiles. ICCL Lucas Louzada, Rafael Martinelli, Victor Abu-Marrul
2020	C	`conf`	An Efficient Matheuristic for the Inventory Routing Problem. ISCO Pedro Diniz, Rafael Martinelli, Marcus Poggi
2020	J	`jnl`	Arc Routing with Time-Dependent Travel Times and Paths. CoRR Thibaut Vidal, Rafael Martinelli, Tuan Anh Pham, Minh Hoàng Hà
2020	J	`jnl`	Industrial and tramp ship routing problems: Closing the gap for real-scale instances. Eur. J. Oper. Res. Gabriel Homsi, Rafael Martinelli, Thibaut Vidal, Kjetil Fagerholt
2018	J	`jnl`	Industrial and Tramp Ship Routing Problems: Closing the Gap for Real-Scale Instances. CoRR Gabriel Homsi, Rafael Martinelli, Thibaut Vidal, Kjetil Fagerholt
2018	J	`jnl`	Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads. CoRR Matheus Nohra Haddad, Rafael Martinelli, Thibaut Vidal, Luiz Satoru Ochi, Simone L. Martins, Marcone Jamilson Freitas Souza, Richard F. Hartl
2018	J	`jnl`	Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads. Eur. J. Oper. Res. Matheus Nohra Haddad, Rafael Martinelli, Thibaut Vidal, Simone L. Martins, Luiz Satoru Ochi, Marcone Jamilson Freitas Souza, Richard F. Hartl
2018	J	`jnl`	The minimum distance superset problem: formulations and algorithms. J. Glob. Optim. Leonardo Fontoura, Rafael Martinelli, Marcus Poggi, Thibaut Vidal
2018	J	`jnl`	The vehicle routing problem with service level constraints. Eur. J. Oper. Res. Teobaldo Bulhões, Minh Hoàng Hà, Rafael Martinelli, Thibaut Vidal
2015	J	`jnl`	Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure. INFORMS J. Comput. Rafael Martinelli, Claudio Contardo
2014	J	`jnl`	A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discret. Optim. Claudio Contardo, Rafael Martinelli
2014	J	`jnl`	Efficient elementary and restricted non-elementary route pricing. Eur. J. Oper. Res. Rafael Martinelli, Diego Pecin, Marcus Poggi
2013	J	`jnl`	Improved bounds for large scale capacitated arc routing problem. Comput. Oper. Res. Rafael Martinelli, Marcus Poggi, Anand Subramanian
2011	B	`conf`	A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem. SEA Rafael Martinelli, Diego Pecin, Marcus Poggi, Humberto J. Longo

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.