/or-tools

Google's Operations Research tools

Primary LanguageC++

These modules have been tested under:
  - Ubuntu 14.04 and 16.04 up (64-bit).
  - Mac OS X El Capitan with Xcode 7.x (64 bit).
  - Microsoft Windows with Visual Studio 2013 and 2015 (64-bit)

Upon checking out the repository, you will get the following structure:

or-tools/
  LICENSE-2.0.txt        <- Apache license
  Makefile               <- Top-level Makefile
  CONTRIBUTING           <- Contribution guidelines
  README                 <- This file
  bin/                   <- Compiled binaries
  dependencies/          <- Built dependencies
  examples/              <- Root directory for all examples
  examples/com/          <- Java examples
  examples/cpp/          <- C++ examples
  examples/csharp/       <- C# examples
  examples/data/         <- Data files for examples
  examples/flatzinc/     <- Flatzinc examples
  examples/python/       <- Python examples
  examples/tests/        <- C# unit tests and bug reports
  lib/                   <- Libraries and jar files
  makefiles/             <- Subsidiary makefiles
  objs/                  <- C++ object files
  src/                   <- Source code
  src/algorithms/        <- Basic algorithms
  src/base/              <- Basic utilities
  src/bop/               <- Boolean solver based on SAT
  src/com/               <- C# and Java source files
  src/constraint_solver/ <- Constraint solver
  src/flatzinc/          <- Flatzinc interpreter
  src/gen/               <- Generated files
  src/glop/              <- Linear solver
  src/graph/             <- Graph algorithms
  src/linear_solver/     <- Linear solver wrapper
  src/lp_data/           <- Data structures for linear model
  src/ortools            <- Python source code
  src/sat/               <- Sat solver
  src/util/              <- Utilities needed by the constraint solver
  tools/                 <- Windows binaries

For installation instructions (both source and binary), visit
https://developers.google.com/optimization/introduction/installing.