A Parallel GRASP for the Steiner Problem in Graphs. - Simone L. Martins; Celso C. Ribeiro; Maurício C. de Souza (IRREGULAR, 1998)

Tabu search for the Steiner problem in graphs. - Celso C. Ribeiro; Maurício C. de Souza (Networks, 2000)

Variable neighborhood search for the degree-constrained minimum spanning tree problem. - Celso C. Ribeiro; Maurício C. de Souza (Discret. Appl. Math., 2002)

Local optimality conditions for multicommodity flow problems with separable piecewise convex costs. - Philippe Mahey; Maurício C. de Souza (Oper. Res. Lett., 2007)

Stronger upper and lower bounds for a hard batching problem to feed assembly lines. - Alexandre Salles da Cunha; Maurício Cardoso de Souza (Electron. Notes Discret. Math., 2008)

Packing items to feed assembly lines. - Maurício C. de Souza; Carlos Roberto Venâncio de Carvalho; Wellington B. Brizon (Eur. J. Oper. Res., 2008)

Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem. - Maurício C. de Souza; Pedro Martins 002 (Eur. J. Oper. Res., 2008)

Models and heuristics for a minimum arborescence problem. - Christophe Duhamel; Luis Eduardo Neves Gouveia; Pedro Moura 002; Maurício C. de Souza (Networks, 2008)

Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs. - Maurício C. de Souza; Philippe Mahey; Bernard Gendron (Networks, 2008)

VNS and second order heuristics for the min-degree constrained minimum spanning tree problem. - Pedro Martins 002; Maurício C. de Souza (Comput. Oper. Res., 2009)

GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem. - Alexandre Xavier Martins; Maurício C. de Souza; Marcone J. F. Souza; Túlio A. M. Toffolo (J. Heuristics, 2009)

md-MST is NP-hard for d>=3. - Ana Maria de Almeida 002; Pedro Martins 002; Maurício C. de Souza (Electron. Notes Discret. Math., 2010)

Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration. - Geraldo Robson Mateus; Martín Gómez Ravetti; Maurício C. de Souza; Taís M. Valeriano (J. Sched., 2010)

A VND-ILS Heuristic to Solve the RWA Problem. - Alexandre Xavier Martins; Christophe Duhamel; Maurício Cardoso de Souza; Rodney Rezende Saldanha; Philippe Mahey (INOC, 2011)

Variable neighborhood descent with iterated local search for routing and wavelength assignment. - Alexandre Xavier Martins; Christophe Duhamel; Philippe Mahey; Rodney Rezende Saldanha; Maurício C. de Souza (Comput. Oper. Res., 2012)

Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations. - Ana Maria de Almeida 002; Pedro Martins 002; Maurício C. de Souza (Int. Trans. Oper. Res., 2012)

Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs. - Christophe Duhamel; Luis Eduardo Neves Gouveia; Pedro Moura 002; Maurício C. de Souza (Networks, 2012)

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem. - Eduardo Uchoa; Túlio A. M. Toffolo; Maurício C. de Souza; Alexandre Xavier Martins; Ricardo Fukasawa (Networks, 2012)

Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks. - Reinaldo Morabito; Maurício C. de Souza; Mariana Vazquez (Eur. J. Oper. Res., 2014)

Surgical scheduling with simultaneous employment of specialised human resources. - Thiago Augusto de Oliveira Silva; Maurício C. de Souza; Rodney R. Saldanha; Edmund K. Burke (Eur. J. Oper. Res., 2015)

Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem. - Christophe Duhamel; Philippe Mahey; Alexandre Xavier Martins; Rodney Rezende Saldanha; Maurício C. de Souza (4OR, 2016)

Time-indexed formulation and polynomial time heuristic for a multi-dock truck scheduling problem in a cross-docking centre. - Priscila M. Cota; Bárbara M. R. Gimenez; Dhiego P. M. Araújo; Thiago Henrique Nogueira; Maurício C. de Souza; Martín Gómez Ravetti (Comput. Ind. Eng., 2016)

Models for scheduling charges in continuous casting: application to a Brazilian steel plant. - Maurício C. de Souza; Aloísio C. Gomes Jr.; Allan Messeder Caldas Bretas; Martín Gómez Ravetti (Optim. Lett., 2016)

Crane scheduling problem with non-interference constraints in a steel coil distribution centre. - Gabriela N. Maschietto; Yassine Ouazene; Martín Gómez Ravetti; Maurício C. de Souza; Farouk Yalaoui (Int. J. Prod. Res., 2017)

Flowshop scheduling problem with parallel semi-lines and final synchronization operation. - Irce F. G. Guimarães; Yassine Ouazene; Maurício C. de Souza; Farouk Yalaoui (Comput. Oper. Res., 2019)

Approaches for the joint resolution of lot-sizing and scheduling with infeasibilities occurrences. - Fernanda F. Alves; Thiago Henrique Nogueira; Maurício C. de Souza; Martín Gómez Ravetti (Comput. Ind. Eng., 2021)

Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods. - Rui Sa Shibasaki; Mourad Baïou; Francisco Barahona; Philippe Mahey; Maurício C. de Souza (Int. Trans. Oper. Res., 2021)

The integrated uncapacitated lot sizing and bin packing problem. - Natã Goulart da Silva; Thiago F. Noronha; Martín Gómez Ravetti; Maurício C. de Souza (RAIRO Oper. Res., 2021)

Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem. - Guido Pantuza Jr.; Maurício C. de Souza (Int. Trans. Oper. Res., 2022)

Volume-based branch-and-cut algorithm for large-scale fixed-charge multicommodity network design. - Rui Sa Shibasaki; Mourad Baïou; Francisco Barahona; Philippe Mahey; Maurício C. de Souza (Ann. Oper. Res., 2025)