Algorithms and software for Cutting and Packing (C&P), in which smaller items must be cut from or packed into a larger item, are computationally intensive due to the combinatorial explosion of the search space and necessary geometric computations. Even today, solving problems with only a dozen items remains a challenge. C&P problems have a high practical and theoretical relevance. Nesting problems, for example, concern the cutting of small objects with irregular geometric shapes from a larger object. Such problems frequently occur in e.g. garment manufacturing, sheet metal cutting and nowadays in 3D printing. 

The aim of this project is to develop fast algorithms and a software toolbox enabling to run the geometric computations on multicore computers and on GPUs, and to develop new parallel meta-heuristic methods for nesting problems.

Applicants should have a master's degree in Computer Science, (Applied) Mathematics, Engineering or Physics, should have experience in programming and be interested in the development and analysis of algorithms for high-performance computing.

We offer a stimulating environment at a European top university, a well-equipped and experienced research unit, a personalized PhD trajectory, with attention paid to transferable skills development, and a competitive wage.