This project hosts operations research tools developed at google and made available open source.

You should read the getting started: http://code.google.com/p/or-tools/wiki/AGettingStarted

Documentation is available at the following address: http://or-tools.googlecode.com/svn/trunk/documentation/documentation_hub.html

The project contains multiple tools:

• A Constraint Programming solver
• A wrapper around third party linear solvers (GLPK. CLP, CBC, SCIP).
• Knapsack algorithms
• Graph algorithms (shortest paths, min cost flow, max flow, linear sum assignment).

Everything is coded in C++ and available through SWIG in Python, Java, and .NET (using mono on non windows platforms).

The standard way to get the code is to checkout the source and build it from scratch. We provide some precompiled archives for the .NET platform in 32 and 64 bit mode. Check the Download section to get them.

You can also suscribe to the or-tools-discuss group and the Google+ page. We will post all news there.

The code is known to compile on:

• gcc 4.4.x on ubuntu 10.04 and 10.10.
• xcode >= 3.2.3 on Mac OS X Snow Leopard and Mac OS X Lion (gcc 4.2.1)
• Microsoft Visual Studio 10.

Both 32 bit and 64 bit architectures are supported, although the code is optimized to run in 64 bit mode.

We also host the 2011-2012 Google Roadef Challenge in data/roadef_challenge_2011/ See http://challenge.roadef.org/2012/fr/