Skip to content

Coluna.jl: A Branch-Cut-and-Price Framework in Julia

Aug 2026 · INFORMS journal on computing · 1 citation · 17 references

TL;DR

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.

Abstract

Mixed-integer programming (MIP) models are highly successful in both academic and industrial settings, but they often suffer from scalability issues and weak relaxations. These issues have been effectively addressed by Dantzig-Wolfe decomposition and branch-cut-and-price (BCP) approaches in many different applications. Such approaches are among the most successful for solving large-scale MIP models; however, their complex and sophisticated implementations might not be practical for nonspecialists. This has prompted the development of generic BCP frameworks, which aim to simplify the implementation process while maintaining a high level of efficiency and flexibility. The present paper introduces Coluna.jl, an innovative BCP framework developed in Julia, a language known for its high computational performance and ease of use. Coluna.jl is an open-source package that enhances user experience by enabling more accessible coding and rapid prototyping without compromising computational efficiency. Among its key advantages, Coluna.jl provides a framework for advanced features like state-of-the-art column generation with dual stabilization, strong branching, and a comprehensive presolve routine. This combination of enabling advanced features and user-friendly implementation establishes Coluna.jl as a significant contribution to the field of optimization software. History: Accepted by Ted Ralphs, Area Editor for Software Tools. Funding: This work was supported by Fundação de Apoio à Pesquisa do Estado da Paraíba [Grants 041/2023, 2021/3182, and 261/2020], Universidade Federal da Paraíba [Grants PVL13395-2020 and PVL13400-2020], and Conselho Nacional de Desenvolvimento Científico e Tecnológico [Grants 309580/2021-8, 314088/2021-0, 311654/2023-1, and 406245/2021-5]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1130 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1130 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

View source

Similar papers

Preprint Sep 2026

Race, Exchange, Improve: Finding high-quality MIP solutions quickly

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...

Gioni Mexi, D. Rehfeldt · 1 citation
Preprint Aug 2026

SDDmiP.jl: A Software Package with a Provably Convergent Benders Algorithm for Multi-Stage Stochastic Mixed-Integer Programming

We present an open-source software package that implements a provably convergent Benders-type decomposition algorithm for multistage stochastic integer programs. In addition to standard cut families, such as Benders, strengthened Benders, and Lagrangian cuts, the algorithm incorporates rectified linear unit (ReLU) cuts...

Akul Bansal, Simge Küçükyavuz · 0 citations
Preprint Sep 2026

Presolve heuristics in HiGHS: implementation and computational study

We present reference implementations of four published primal heuristics for mixed-integer programming inside the open-source solver HiGHS (Huangfu and Hall, 2018): Feasibility Jump (Luteberget and Sartor, 2023), fix-propagate-repair (FPR; Salvagnin, Roberti and Fischetti, 2025) with its LP-guided dive-time variant, Lo...

Simon Spoorendonk · 0 citations
Preprint Sep 2026

4-Block Integer Programming is in FPT

Integer programming is a fundamental and important NP-hard problem. This motivated extensive efforts in studying several tractable subclasses. One of the top unresolved complexity questions is the parameterized complexity of 4-block IPs, a natural class characterized by having a diagonal matrix with small blocks after...

Martin Koutecký, Alexandra Lassota, Koen Ligthart · 0 citations
Preprint Aug 2026

Not All Problems Are Best Modeled as MILP: A DSL-Centric Framework for Flexible and Accurate Optimization Modeling

OptiDSL is proposed, a framework that shifts the focus from rigid MILP formulations to domain-specific language (DSL) representations, and enables seamless integration with a diverse library of specialized solvers, ranging from traditional heuristics to modern learning-based methods.

Shao-Feng Zhang, Hongyuan Su, Qing Peng et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.