12 citations · 37 across the 4 of their papers we have counts for
4 papers
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…
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…
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…
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos +1
This work deals with a class of problems under interval data uncertainty, namely interval robust-hard problems, composed of interval data min-max regret generalizations of classica…