1 citations · 1 across the 1 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
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…