The problem for the 2024 edition is one-side crossing minimization: Given is a bipartite graph \((A, B)\) that is drawn in standard way with the nodes of both \(A\) and \(B\) on a line, where the order of the nodes of \(A\) is fixed. Our solution: Branch & bound on the optimal order from left to right, after finding strong fixed pairs and practically fixed pairs. Optimizations: Optimal insert: don’t just append nodes, but insert them optimally into the prefix Tail cache: Cache results for every tail.