3 papers
math.OC2024
The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
David Wittwer, Felix Tamke
Many production processes require the cooperation of various resources. Especially when using expensive machines, their utilization plays a decisive role in efficient production. I…
math.OC2024
A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints
Felix Tamke, Florian Linß, Leopold Kuttner +1
This paper presents a new branch-and-cut algorithm based on infeasible path elimination for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) with differe…
cs.DM2023
A new branch-and-cut approach for integrated planning in additive manufacturing
Benedikt Zipfel, Felix Tamke, Leopold Kuttner
In recent years, there has been considerable interest in the transformative potential of additive manufacturing (AM) since it allows for producing highly customizable and complex c…