google/or-tools

Health v2 · maintenance only

Adoption not part of the score

13946 stars · 2471 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-29, confidence not recorded

Google's open-source Operations Research suite for combinatorial optimization, written in C++ with wrappers for Python, C#, and Java. It includes constraint programming solvers (CP-SAT), linear programming solvers (Glop, PDLP), and algorithms for routing, bin packing, flows, and assignment problems.

Use cases

• solve vehicle routing problems
• solve linear and integer programming models
• schedule employees or tasks with constraint programming
• solve bin packing and knapsack problems
• compute shortest paths and max flow in graphs
• model and solve assignment problems
• use CP-SAT to solve constraint satisfaction problems

When to choose

• you need a fast, proven optimization solver suite with multi-language bindings
• you are solving routing, scheduling, packing, or flow problems
• you want a free alternative to commercial solvers like CPLEX or Gurobi, or a wrapper to use them interchangeably

When to avoid

• you need general-purpose numerical linear algebra rather than discrete optimization
• you need a lightweight dependency for simple math operations
• your problem is small enough that a simple heuristic suffices

Facets

library · maturity stable

math simulation developer-tools mathematics logistics data-science cpp python jvm dotnet cross-platform optimization constraint-programming linear-programming vehicle-routing combinatorial-optimization operations-research cp-sat graph-algorithms bin-packing algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="google/or-tools")