abstract
- This archive contains the code of our solver for the PACE 2024 challenge consisting in solving the one-sided crossing minimization (OCM) problem. This problem consists in finding in a bipartite graph, where one subset of vertices is fixed on one line and where the other subset of vertices can be reordered on a parallel line, an order which minimizes the number of crossings between the edges.