Skip to content

Version 0.5.4

Choose a tag to compare

View all tags
@StevenBtw StevenBtw released this 24 Jan 19:59
· 82 commits to main since this release
v0.5.4
3c4a5e0
This commit was created on GitHub.com and signed with GitHub’s verified signature.
GPG key ID: B5690EEEBB952194
Verified
Learn about vigilant mode.

[0.5.4] - 2026-01-24

Added

  • Column Generation: Added solve_cg() for problems with exponentially many variables. Implements Dantzig-Wolfe decomposition with LP master problem and customizable pricing. Built-in cutting stock mode with knapsack pricing, or provide your own pricing function for bin packing, vehicle routing, crew scheduling, graph coloring, etc.

  • OR-Tools Examples:* 24 converted examples showing solvOR as drop-in replacement for Google OR-Tools Organized by category:

    • Linear Solver (13): LP, MIP, assignment, bin packing, knapsack problems using solve_lp, solve_milp, solve_hungarian, solve_bin_pack
    • CP-SAT (7): Constraint satisfaction using Model and solve_job_shop - simple CSP, N-Queens, nurse scheduling, job shop, solution enumeration
    • Graph (2): Max flow and linear sum assignment using max_flow, solve_hungarian
    • Algorithms (2): Knapsack problems using solve_knapsack

*All converted examples where generated using AI.

  • OR-Tools Documentation: New index page at docs/examples/ortools.md with benchmark comparisons. solvOR often faster for small problems (pure Python startup vs C++ overhead), competitive on medium problems, OR-Tools wins on large problems as expected.

Changed

  • MILP: Greedy rounding + LNS heuristics for binary MIPs. Enable with lns_iterations parameter.

Fixed

  • Bugfix for simplex.py.

Full Changelog: v0.5.3...v0.5.4

Assets 2
Loading