A hybrid genetic algorithm with local search approach for E/T scheduling problems on identical parallel machines. - Rainer Amorim; Bruno Dias 001; Rosiane de Freitas Rodrigues; Eduardo Uchoa (GECCO (Companion), 2013)

Distance geometry approach for special graph coloring problems. - Rosiane de Freitas Rodrigues; Bruno Dias 001; Nelson Maculan; Jayme Luiz Szwarcfiter (CoRR, 2016)

Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model. - Bruno Dias 001; Rosiane de Freitas Rodrigues; Nelson Maculan; Javier Marenco (Electron. Notes Discret. Math., 2017)

The Distance Polytope for the Vertex Coloring Problem. - Bruno Dias 001; Rosiane de Freitas Rodrigues; Nelson Maculan; Javier Marenco (ISCO, 2018)

On distance graph coloring problems. - Rosiane de Freitas Rodrigues; Bruno Dias 001; Nelson Maculan; Jayme Luiz Szwarcfiter (Int. Trans. Oper. Res., 2021)

Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem. - Bruno Dias 001; Rosiane de Freitas Rodrigues; Nelson Maculan; Philippe Michelon (RAIRO Oper. Res., 2021)