12 citations · 21 across the 2 of their papers we have counts for
2 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★ 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…