Year: 2026
Type: preprint
Abstract: A column generation solver for the minimum-cost multicommodity flow problem, supporting both path-based and tree-based Dantzig-Wolfe decompositions over a shared CG loop. This archive is the computational artifact accompanying “Tree-based formulation for the multi-commodity flow problem” (arXiv:2509.24656). It contains the solver, four LP backends (HiGHS, MOSEK, COPT, NVIDIA cuOpt) behind one interface, every benchmark instance of all four families, the instance-preparation and benchmark scripts, and the committed result tables under results/. PROVENANCE.txt pins the exact solver versions, host and patches behind those tables, and states which results are reproducible with open-source components only. The default build is HiGHS-only and needs no licence and no GPU.
Source: arXiv (Cornell University)
Authors: Spoorendonk, Simon, Petersen, Bjørn
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7084166539
Cites:
Cited by:
Related to: