12 citations · 26 across the 3 of their papers we have counts for
3 papers
math.OC2020★ 9 cited
Coupling Feasibility Pump and Large Neighborhood Search to solve the Steiner team orienteering problem
Lucas Assunção, Geraldo Robson Mateus
The Steiner Team Orienteering Problem (STOP) is defined on a digraph in which arcs are associated with traverse times, and whose vertices are labeled as either mandatory or profita…
cs.DS2020★ 5 cited
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs
Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha +1
This paper addresses a class of problems under interval data uncertainty composed of min-max regret versions of classical 0-1 optimization problems with interval costs. We refer to…
cs.DS2020★ 12 cited
A cutting-plane algorithm for the Steiner team orienteering problem
Lucas Assunção, Geraldo Robson Mateus
The Team Orienteering Problem (TOP) is an NP-hard routing problem in which a fleet of identical vehicles aims at collecting rewards (prizes) available at given locations, while sat…