1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.OC2024★ 1 cited
Order acceptance and scheduling in capacitated job shops
Florian Linß, Mike Hewitt, Janis S. Neufeld +1
We consider a capacitated job shop problem with order acceptance. This research is motivated by the management of a research and development project pipeline for a company in the a…
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.DM2021
The vehicle routing problem with drones and drone speed selection
Felix Tamke, Udo Buscher
Joint parcel delivery by trucks and drones has enjoyed significant attention for some time, as the advantages of one delivery method offset the disadvantages of the other. This pap…