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; Rafael Andrade 001 (ISCO, 2016)

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; Rafael Andrade 001 (Comput. Oper. Res., 2017)

A cutting-plane algorithm for the Steiner team orienteering problem. - Lucas Assunção; Geraldo Robson Mateus (Comput. Ind. Eng., 2019)

Corrigendum to "A cutting-plane algorithm for the Steiner team orienteering problem" [Comput. Ind. Eng. 135 (2019) 922-939]. - Lucas Assunção; Geraldo Robson Mateus (Comput. Ind. Eng., 2020)

Coupling Feasibility Pump and Large Neighborhood Search to solve the Steiner team orienteering problem. - Lucas Assunção; Geraldo Robson Mateus (Comput. Oper. Res., 2021)

Improving logic-based Benders' algorithms for solving min-max regret problems. - Lucas Assunção; Andréa Cynthia Santos; Thiago F. Noronha; Rafael Andrade 001 (Oper. Res. Decis., 2021)