Cleder M. Schenekemberg
Orcid: 0000-0003-0535-9656
According to our database1,
Cleder M. Schenekemberg
authored at least 10 papers
between 2019 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation.
Ann. Oper. Res., August, 2025
2024
A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem.
Expert Syst. Appl., March, 2024
J. Oper. Res. Soc., January, 2024
A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems.
Transp. Sci., 2024
2022
Comput. Oper. Res., 2022
Comput. Chem. Eng., 2022
2021
2020
Eur. J. Oper. Res., 2020
Comput. Oper. Res., 2020
2019