Cleder M. Schenekemberg

Orcid: 0000-0003-0535-9656

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem.
Expert Syst. Appl., March, 2024

Mechanisms for feasibility and improvement for inventory-routing problems.
J. Oper. Res. Soc., January, 2024

A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems.
Transp. Sci., 2024

2022
The dial-a-ride problem with private fleet and common carrier.
Comput. Oper. Res., 2022

A two-level lot sizing and scheduling problem applied to a cosmetic industry.
Comput. Chem. Eng., 2022

2021
The two-echelon production-routing problem.
Eur. J. Oper. Res., 2021

2020
The exact solutions of several types of container loading problems.
Eur. J. Oper. Res., 2020

The two-echelon inventory-routing problem with fleet management.
Comput. Oper. Res., 2020

2019
The two-echelon multi-depot inventory-routing problem.
Comput. Oper. Res., 2019


  Loading...