Papers › Merging Combinatorial Design and Optimization: the Oberwolfach Problem
Merging Combinatorial Design and Optimization: the Oberwolfach Problem
Fabio Salassa, Gabriele Dragotto, Tommaso Traetta, Marco Buratti, Federico Della Croce
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The Oberwolfach Problem OP(F) -- posed by Gerhard Ringel in 1967 -- is a paradigmatic Combinatorial Design problem asking whether the complete graph Kᵥ decomposes into edge-disjoint copies of a $2$-regular graph F of order v. In this paper, we provide all the necessary equipment to generate solutions to OP(F) for relatively small orders by using the so-called difference methods. From the theoretical standpoint, we present new insights on the combinatorial structures involved in the solution of the problem. Computationally, we provide a full recipe whose base ingredients are advanced optimization models and tailored algorithms. This algorithmic arsenal can solve the OP(F) for all possible orders up to $60$ with the modest computing resources of a personal computer. The new $20$ orders, from $41$ to $60$, encompass $241200$ instances of the Oberwolfach Problem, which is 22 times greater than those solved in previous contributions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections