Development of branch-and-price algorithms for various use cases
Often mathematical models for real problem instances can no longer be solved exactly using standard solvers. In this case, special algorithms tailored to the problem are required. One such type of algorithm is branch-and-price algorithms, which can solve complex integer problems indirectly, leading to more precise results. The plan-based Dantzig-Wolfe decomposition plays an essential role here. These algorithms offer a wide range of possibilities for specific optimisations. The aim of this research project is therefore to find out which optimisations are suitable for which problem structures and which are not.
