OR-Tools is an open source software suite for optimization, tuned for tackling the world's toughest problems in vehicle routing, flows, integer and linear programming, and constraint programming.
After modeling your problem in the programming language of your choice, you can use any of a half dozen solvers to solve it: commercial solvers such as Gurobi or CPLEX, or open-source solvers such as SCIP, GLPK, or Google's GLOP and award-winning CP-SAT.
What's New
Platforms
- Drop Python 3.8 support
- Drop .Net 6.0 support
- Migrate to .Net 8.0 as TFM in archives and nuget package
- Add Fedora 42 support.
- Java: may drop Java 8 in favor of Java 11 as minimum supported.
Dependencies
C++
- abseil-cpp 20250512.0
- Protobuf v31.0
- HiGHS v1.10.0
- SCIP v922
Python
- Add typing-extensions dependencies
CP-SAT
- Improvements to the no_overlap_2d constraint (presolve, propagation, and cuts)
- Speedup feasibility jump and violation ls
- Detect, store and use precedences, with their bounds (lb <= a * x + b * y <= ub) in presolve, propagation, and cuts
- Cleanup and improve presolve
- Deep improvements to routing cuts. Detect transition between nodes. Detect capacity constraints
- Improvement to scheduling cuts
- Improve clause sharing between workers in shared_tree and portfolio search
- sat_runner: supports parsing .pb, .wbo files
- Python: better support for float coefficient and bounds
- The usual bug fixes and speedups
