OR-Tools
Open source software suite by Google
From Wikipedia, the free encyclopedia
Google OR-Tools is a free and open-source software suite developed by Google for solving linear programming (LP), mixed integer programming (MIP), constraint programming (CP), vehicle routing (VRP), and related optimization problems.[3] OR stands for operations research.
| OR-Tools | |
|---|---|
 | |
| Original author | Laurent Perron |
| Developer | Google Optimization team[1] |
| Initial release | September 15, 2010 |
| Stable release | v9.9.3963[2]
/ March 7, 2024 |
| Written in | C++ |
| Operating system | Linux, macOS, Microsoft Windows |
| Type | Library |
| License | Apache License 2.0 |
| Website | developers |
| Repository | github |
OR-Tools is a set of components written in C++ but provides wrappers for Java, .NET and Python.
It is distributed under the Apache License 2.0.[4]
History
OR-Tools was created by Laurent Perron in 2011.[5]
In 2014, Google's open source linear programming solver, GLOP, was released as part of OR-Tools.[1]
The CP-SAT solver[6] bundled with OR-Tools has been consistently winning gold medals in the MiniZinc Challenge,[7] an international constraint programming competition.
Features
The OR-Tools supports a variety of programming languages, including:
- Object-oriented interfaces for C++[8]
- A Java wrapper package[9]
- A .NET and .NET Framework wrapper package[10]
- A Python wrapper package[11][12]
OR-Tools supports a wide range of problem types,[13][3] among them:
- Assignment problem[14]
- Linear programming
- Mixed-integer programming[15]
- Constraint programming[6]
- Vehicle routing problem[14][16]
- Network flow algorithms
It supports the FlatZinc modeling language.[17]