Lucas Assunção

According to our database, Lucas Assunção authored at least 8 papers between 2016 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Break minimization in incomplete round-robin tournaments.

Dominique de Werra, Sebastián Urrutia, Lucas Assunção

Discret. Appl. Math., 2026

2025

Minimizing breaks in incomplete round-robin tournaments.

Dominique de Werra, Sebastián Urrutia, Lucas Assunção

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

2021

Improving logic-based Benders' algorithms for solving min-max regret problems.

Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade

Oper. Res. Decis., 2021

Coupling Feasibility Pump and Large Neighborhood Search to solve the Steiner team orienteering problem.

Lucas Assunção, Geraldo Robson Mateus

Comput. Oper. Res., 2021

2020

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

2019

A cutting-plane algorithm for the Steiner team orienteering problem.

Lucas Assunção, Geraldo Robson Mateus

Comput. Ind. Eng., 2019

2017

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

Comput. Oper. Res., 2017

2016

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

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016