s2mflow is an open-source, cross-platform Python library for lifting single-commodity minimum-cost flow instances into the multicommodity space, and introduces the specialized .mcfmin file format for compact, reproducible storage.
Abstract
Benchmark instances for multicommodity flow problems often fail to capture the structural characteristics of real-world networks or preserve a rigorous relationship with their single-commodity counterparts. To address these limitations, this paper presents s2mflow : an open-source, cross-platform Python library for lifting single-commodity minimum-cost flow instances into the multicommodity space. Unlike existing generators, s2mflow makes this structural relationship an explicit design principle of the instance construction process, enabling the generation of structurally grounded benchmarks. The package combines a Python interface with a high-performance Rust backend built with PyO3 and maturin, and is distributed via PyPI for Linux and macOS on x86_64 and ARM64, and Windows on x64. It provides integer partitioning methods to control commodity-demand heterogeneity, a key factor for the Single-Multi-Commodity Gap and solver performance. Additionally, s2mflow introduces the specialized .mcfmin file format for compact, reproducible storage. The resulting instances are suitable for benchmarking methods in linear programming, network optimization, and transportation science.
This paper introduces Coluna.jl, an innovative BCP framework developed in Julia, a language known for its high computational performance and ease of use, and establishes Coluna.jl as a significant contribution to the field of optimization software.
F. Vanderbeck, Guillaume Marquès, R. Sadykov et al.· INFORMS journal on computing· 1 citation
K-adaptive Ensembled Partitioning (KEP) is presented, which combines recursive bisection and direct 𝐾 -way search and replaces hard-feasibility Fiduccia–Mattheyses (FM) with an augmented-Lagrangian refinement step (AL-FM) that can cross short infeasible regions before repairing balance.
This work proposes a scalable continuous-optimization algorithm for large-scale single-commodity FCNFP based on an iteratively reweighted least-squares (IRLS) framework and develops an algorithmic variant that incorporates objective-driven perturbation restarts and an anchor-union restricted search that jointly leverag...
The Dual-GNN Multilevel Coarsening framework uses learning to guide multilevel graph coarsening while retaining combinatorial search for final decision making and achieves the best mean solution quality among all evaluated methods.
Mixed-integer programming (MIP) is a cornerstone in applied optimization, both in industry and academia. Recently, there has been increased attention to finding strong primal solutions quickly. This is reflected, for example, in the development of the NVIDIA cuOpt solver and, most recently, in the new MIPFEAS benchmark...
In recent years, the Carousel Greedy (CG) algorithm has gained increasing attention as a simple yet effective heuristic for a broad class of combinatorial optimization problems, with applications ranging from graph theory to logistics and network analysis. Building on a preliminary study that presented the first open-s...
Raffaele Dragone, Carmine Cerrone, Bruce L. Golden· Algorithms· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.