Cleder M. Schenekemberg

According to our database, Cleder M. Schenekemberg authored at least 8 papers between 2019 and 2024.

Collaborative distances:

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

2024

A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem.

Antônio Augusto Chaves, Bárbara Lessa Vianna, Tiago Tiburcio da Silva, Cleder Marcos Schenekemberg

Expert Syst. Appl., March, 2024

Mechanisms for feasibility and improvement for inventory-routing problems.

Thiago A. Guimarães, Cleder M. Schenekemberg, Leandro C. Coelho, Cassius Tadeu Scarpin, José Eduardo Pécora Junior

J. Oper. Res. Soc., January, 2024

2022

The dial-a-ride problem with private fleet and common carrier.

Cleder M. Schenekemberg, Antonio Augusto Chaves, Leandro C. Coelho, Thiago A. Guimarães, Geraldo Avelino

Comput. Oper. Res., 2022

A two-level lot sizing and scheduling problem applied to a cosmetic industry.

Talita M. P. Schimidt, Cassius Tadeu Scarpin, Gustavo V. Loch, Cleder M. Schenekemberg

Comput. Chem. Eng., 2022

2021

The two-echelon production-routing problem.

Cleder M. Schenekemberg, Cassius Tadeu Scarpin, José Eduardo Pécora Junior, Thiago A. Guimarães, Leandro C. Coelho

Eur. J. Oper. Res., 2021

2020

The exact solutions of several types of container loading problems.

Deidson Vitorio Kurpel, Cassius Tadeu Scarpin, José Eduardo Pécora Junior, Cleder Marcos Schenekemberg, Leandro C. Coelho

Eur. J. Oper. Res., 2020

The two-echelon inventory-routing problem with fleet management.

Cleder M. Schenekemberg, Cassius Tadeu Scarpin, José Eduardo Pécora Junior, Thiago A. Guimarães, Leandro C. Coelho

Comput. Oper. Res., 2020

2019

The two-echelon multi-depot inventory-routing problem.

Thiago A. Guimarães, Leandro C. Coelho, Cleder M. Schenekemberg, Cassius Tadeu Scarpin

Comput. Oper. Res., 2019