Lucas Assunção

Publication Activity (10 Years)

Years Active: 2016-2021
Publications (10 Years): 9

Top Topics

Cutting Plane Algorithm

Linear Programming

Valid Inequalities

Optimization Problems

Top Venues

Comput. Oper. Res.

Comput. Ind. Eng.

Publications

Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade
Improving logic-based Benders' algorithms for solving min-max regret problems. Oper. Res. Decis. 31 (2) (2021)
Lucas Assunção, Geraldo Robson Mateus
Coupling Feasibility Pump and Large Neighborhood Search to solve the Steiner team orienteering problem. Comput. Oper. Res. 128 (2021)
Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs. CoRR (2020)
Lucas Assunção, Geraldo Robson Mateus
A cutting-plane algorithm for the Steiner team orienteering problem. CoRR (2020)
Lucas Assunção, Geraldo Robson Mateus
Corrigendum to "A cutting-plane algorithm for the Steiner team orienteering problem" [Comput. Ind. Eng. 135 (2019) 922-939]. Comput. Ind. Eng. 141 (2020)
Lucas Assunção, Geraldo Robson Mateus
A cutting-plane algorithm for the Steiner team orienteering problem. Comput. Ind. Eng. 135 (2019)
Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos, Rafael Andrade
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. Comput. Oper. Res. 81 (2017)
Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-Max Regret Optimization Problems with Interval Costs. ISCO (2016)
Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos, Rafael Andrade
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. CoRR (2016)