The two-echelon multi-depot inventory-routing problem. - Thiago André Guimarães; Leandro C. Coelho; Cleder M. Schenekemberg; Cassius Tadeu Scarpin (Comput. Oper. Res., 2019)

The two-echelon inventory-routing problem with fleet management. - Cleder M. Schenekemberg; Cassius Tadeu Scarpin; José Eduardo Pécora Junior; Thiago André Guimarães; Leandro C. Coelho (Comput. Oper. Res., 2020)

The two-echelon production-routing problem. - Cleder M. Schenekemberg; Cassius Tadeu Scarpin; José Eduardo Pécora Junior; Thiago André Guimarães; Leandro C. Coelho (Eur. J. Oper. Res., 2021)

The dial-a-ride problem with private fleet and common carrier. - Cleder M. Schenekemberg; Antonio Augusto Chaves; Leandro C. Coelho; Thiago André Guimarães; Geraldo Avelino (Comput. Oper. Res., 2022)

A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems. - Cleder Marcos Schenekemberg; Thiago André Guimarães; Antonio Augusto Chaves; Leandro C. Coelho (Transp. Sci., 2024)

Mechanisms for feasibility and improvement for inventory-routing problems. - Thiago André Guimarães; Cleder M. Schenekemberg; Leandro C. Coelho; Cassius Tadeu Scarpin; José Eduardo Pécora Junior (J. Oper. Res. Soc., 2024)

Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation. - Cleder M. Schenekemberg; Antonio Augusto Chaves; Thiago André Guimarães; Leandro C. Coelho (Ann. Oper. Res., 2025)