This page gives links to the web pages for all COIN-OR projects. An alphabetical list follows the categorical list below.

## Projects by category:

### Developer tools

- BuildTools: COIN-OR Unix developer tools and documentation, tools for managing configuration and compilation of various COIN-OR projects under Linux, Unix, and Cygwin
- CoinBazaar: The COIN-OR Bazaar, small examples and extensions of COIN-OR projects
- CoinBinary: COIN-OR Binary Distributions, pre-compiled binary distributions of COIN-OR projects
- Coopr: A COmmon Optimization Python Repository , the Coopr software project integrates a variety of Python optimization-related packages. Coopr supports a diverse set of optimization capabilities that can be used formulate and analyze optimization applications
- TestTools: TestTools, Python scripts to automatically download, configure, build, test, and install COIN-OR projects

### Documentation

- CoinEasy: New user information and support, CoinEasy is designed for new users of COIN-OR. The objective is to make it easy to use COIN-OR projects. Different users have different objectives and we provide information on how to get up and running easily depending upon objective

### Graphs

- CGC: COIN-OR Graph Classes, a collection of network representations and algorithms
- GiMPy: Graph Methods in Python, Graph Methods in Python (GiMPy) is a Python graph library containing pure Python implementations of a variety of graph algorithm with visualizations
- GrUMPy: Graphics for Understanding Mathematical Programming, Graphics for Understanding Mathematical Programming in Python (GrUMPy) is a Python library for visualizing various aspects of mathematical programming, including visualizations of the branch-and process, branch-and-bound trees, polyhedra, cutting plane methods, etc.
- LEMON: Library of Efficient Models and Optimization in Networks, a C++ template library aimed at combinatorial optimization tasks, especially those working with graphs and networks

### Interfaces

- AIMMSlinks: AIMMS/COIN-OR Links, links between the modeling language AIMMS and solvers that are hosted at COIN-OR
- CMPL: Coliop / Coin Mathematical Programming Language, a mathematical programming language and a system for modelling
- CoinMP: CoinMP, a lightweight API and DLL for CLP, CBC, and CGL
- CyLP: Python interface to Cbc and Clp, a Python interface to Cbc and Clp
- GAMSlinks: GAMS/COIN-OR Links, links between GAMS (General Algebraic Modeling System) and solvers that are hosted at COIN-OR
- NLPAPI: Nonlinear Programming API, a subroutine interface for defining and solving nonlinear programming problems
- OS: Optimization Services, standards for representing optimization instances, results, solver options, and communication between clients and solvers in a distributed environment using Web Services
- OSI: Open Solver Interface, a uniform API for calling embedded linear and mixed-integer programming solvers
- PuLP: Python library for modeling linear and integer programs, a Python library for modeling linear and integer programs
- SMI: Stochastic Modeling Interface, for optimization under uncertainty
- yaposib: Yet Another Python OSI Binding, a Python interface to linear solvers that use the OSI

### Metaheuristics

- Djinni: Djinni, a templatized C++ framework with Python bindings for heuristic search
- METSlib: METSlib, an object oriented metaheuristics optimization framework and toolkit in C++
- OTS: Open Tabu Search, a framework for constructing tabu search algorithms

### Modeling systems

- AIMMSlinks: AIMMS/COIN-OR Links, links between the modeling language AIMMS and solvers that are hosted at COIN-OR
- CMPL: Coliop / Coin Mathematical Programming Language, a mathematical programming language and a system for modelling
- Coopr: A COmmon Optimization Python Repository , the Coopr software project integrates a variety of Python optimization-related packages. Coopr supports a diverse set of optimization capabilities that can be used formulate and analyze optimization applications
- CyLP: Python interface to Cbc and Clp, a Python interface to Cbc and Clp
- FLOPC++: FLOPC++, an algebraic modeling language embedded in C++
- GAMSlinks: GAMS/COIN-OR Links, links between GAMS (General Algebraic Modeling System) and solvers that are hosted at COIN-OR
- GiMPy: Graph Methods in Python, Graph Methods in Python (GiMPy) is a Python graph library containing pure Python implementations of a variety of graph algorithm with visualizations
- OS: Optimization Services, standards for representing optimization instances, results, solver options, and communication between clients and solvers in a distributed environment using Web Services
- PuLP: Python library for modeling linear and integer programs, a Python library for modeling linear and integer programs
- ROSE: Reformulation-Optimization Software Engine, software for performing symbolic reformulations to Mathematical Programs (MP)
- yaposib: Yet Another Python OSI Binding, a Python interface to linear solvers that use the OSI

### Optimization convex non-differentiable

- OBOE: Oracle Based Optimization Engine, optimization of convex problems with user-supplied methods delivering key first order information (like support to the feasible set, support to the objective function)

### Optimization deterministic linear continuous

- CLP: COIN-OR LP, a simplex solver
- CoinMP: CoinMP, a lightweight API and DLL for CLP, CBC, and CGL
- CyLP: Python interface to Cbc and Clp, a Python interface to Cbc and Clp
- DyLP: Dynamic LP, an implementation of the dynamic simplex methods
- FLOPC++: FLOPC++, an algebraic modeling language embedded in C++
- OSI: Open Solver Interface, a uniform API for calling embedded linear and mixed-integer programming solvers
- VOL: Volume Algorithm, a subgradient algorithm that also computes approximate primal solutions
- yaposib: Yet Another Python OSI Binding, a Python interface to linear solvers that use the OSI

### Optimization deterministic linear discrete

- ABACUS: A Branch-And-CUt System, an LP-based branch-and-cut framework
- BCP: Branch-Cut-Price Framework, a framework for constructing parallel branch-cut-price algorithms for mixed-integer linear programs
- CBC: COIN-OR Branch and Cut, an LP-based branch-and-cut library
- CGL: Cut Generator Library, a library of cutting-plane generators
- CHiPPS: COIN-OR High Performance Parallel Search Framework, a framework for constructing parallel tree search algorithms (includes an LP-based branch-cut-price implementation)
- Crème: COIN-OR Relaxation Method, an implementation of the randomized thermal relaxation method to find a feasible solution of the Maximum Feasible Subsystem problem
- CyLP: Python interface to Cbc and Clp, a Python interface to Cbc and Clp
- DIP: Decomposition in Integer Programming , a framework for implementing a variety of decomposition-based branch-and-bound algorithms for solving mixed integer linear programs
- KSP: K Shortest Paths, algorithms for K shortest paths
- SYMPHONY: SYMPHONY, a callable library for solving mixed-integer linear programs
- VRPH: VRP Heuristics, a library of heuristics for generating solutions to variants of the vehicle routing problem
- yaposib: Yet Another Python OSI Binding, a Python interface to linear solvers that use the OSI

### Optimization deterministic nonlinear

- DFO: Derivative-Free Optimization, a package for solving general nonlinear optimization problems when derivatives are unavailable
- filterSD: Subroutines for nonlinear optimization, a library for nonlinear optimization written in Fortran
- Ipopt: Interior-Point Optimizer, for general large-scale nonlinear optimization
- MOCHA: Matroid Optimization: Combinatorial Heuristics and Algorithms, heuristics and algorithms for multicriteria matroid optimization
- NLPAPI: Nonlinear Programming API, a subroutine interface for defining and solving nonlinear programming problems
- OptiML: Optimization for Machine learning, interior point, active set method and parametric solvers for support vector machines, solver for the sparse inverse covariance problem
- qpOASES: QP solver using the online active set strategy, an open-source C++ implementation of the recently proposed online active set strategy

### Optimization deterministic nonlinear discrete

- Bonmin: Basic Open-source Nonlinear Mixed INteger programming, an experimental open-source C++ code for solving general MINLP (Mixed Integer NonLinear Programming) problems
- Couenne: Couenne, a branch-and-bound algorithm for mixed integer nonlinear programming problems
- LaGO: Lagrangian Global Optimizer, for the global optimization of nonconvex mixed-integer nonlinear programs

### Optimization deterministic semidefinite continuous

- CSDP: CSDP, an interior-point method for semidefinite programming

### Optimization stochastic

- Coopr: A COmmon Optimization Python Repository , the Coopr software project integrates a variety of Python optimization-related packages. Coopr supports a diverse set of optimization capabilities that can be used formulate and analyze optimization applications
- SMI: Stochastic Modeling Interface, for optimization under uncertainty

### Optimization utility

- ADOL-C: ADOL-C, package for the automatic differentiation of C and C++ programs
- CHiPPS: COIN-OR High Performance Parallel Search Framework, a framework for constructing parallel tree search algorithms (includes an LP-based branch-cut-price implementation)
- CoinBazaar: The COIN-OR Bazaar, small examples and extensions of COIN-OR projects
- CoinUtils: COIN-OR utilities, utilities, data structures, and linear algebra methods for COIN-OR projects
- CppAD: CppAD, a tool for differentiation of C++ functions
- LEMON: Library of Efficient Models and Optimization in Networks, a C++ template library aimed at combinatorial optimization tasks, especially those working with graphs and networks
- MC++: Toolkit for Bounding Factorable Functions, provides methods for computing bounds on a factorable function, in the form of convex/concave relaxations, Taylor models, and spectral bounds
- oBB: Overlapping Branch and Bound, an algorithm for the parallel global optimization of functions with Lipchitz continuous gradient or Hessian
- OS: Optimization Services, standards for representing optimization instances, results, solver options, and communication between clients and solvers in a distributed environment using Web Services
- Paver: Paver, Python scripts to do comparisons of solver performance
- PFunc: Parallel Functions, a lightweight and portable library that provides C and C++ APIs to express task parallelism
- ROSE: Reformulation-Optimization Software Engine, software for performing symbolic reformulations to Mathematical Programs (MP)

### Python tools

- CyLP: Python interface to Cbc and Clp, a Python interface to Cbc and Clp
- GiMPy: Graph Methods in Python, Graph Methods in Python (GiMPy) is a Python graph library containing pure Python implementations of a variety of graph algorithm with visualizations
- GrUMPy: Graphics for Understanding Mathematical Programming, Graphics for Understanding Mathematical Programming in Python (GrUMPy) is a Python library for visualizing various aspects of mathematical programming, including visualizations of the branch-and process, branch-and-bound trees, polyhedra, cutting plane methods, etc.
- Paver: Paver, Python scripts to do comparisons of solver performance
- PuLP: Python library for modeling linear and integer programs, a Python library for modeling linear and integer programs
- yaposib: Yet Another Python OSI Binding, a Python interface to linear solvers that use the OSI

### Visualization software

- GrUMPy: Graphics for Understanding Mathematical Programming, Graphics for Understanding Mathematical Programming in Python (GrUMPy) is a Python library for visualizing various aspects of mathematical programming, including visualizations of the branch-and process, branch-and-bound trees, polyhedra, cutting plane methods, etc.

### Web services

## Projects alphabetically:

- ABACUS: A Branch-And-CUt System, an LP-based branch-and-cut framework
- ADOL-C: ADOL-C, package for the automatic differentiation of C and C++ programs
- AIMMSlinks: AIMMS/COIN-OR Links, links between the modeling language AIMMS and solvers that are hosted at COIN-OR
- BCP: Branch-Cut-Price Framework, a framework for constructing parallel branch-cut-price algorithms for mixed-integer linear programs
- Bonmin: Basic Open-source Nonlinear Mixed INteger programming, an experimental open-source C++ code for solving general MINLP (Mixed Integer NonLinear Programming) problems
- BuildTools: COIN-OR Unix developer tools and documentation, tools for managing configuration and compilation of various COIN-OR projects under Linux, Unix, and Cygwin
- CBC: COIN-OR Branch and Cut, an LP-based branch-and-cut library
- CGC: COIN-OR Graph Classes, a collection of network representations and algorithms
- CGL: Cut Generator Library, a library of cutting-plane generators
- CHiPPS: COIN-OR High Performance Parallel Search Framework, a framework for constructing parallel tree search algorithms (includes an LP-based branch-cut-price implementation)
- CLP: COIN-OR LP, a simplex solver
- CMPL: Coliop / Coin Mathematical Programming Language, a mathematical programming language and a system for modelling
- CoinBazaar: The COIN-OR Bazaar, small examples and extensions of COIN-OR projects
- CoinBinary: COIN-OR Binary Distributions, pre-compiled binary distributions of COIN-OR projects
- CoinEasy: New user information and support, CoinEasy is designed for new users of COIN-OR. The objective is to make it easy to use COIN-OR projects. Different users have different objectives and we provide information on how to get up and running easily depending upon objective
- CoinMP: CoinMP, a lightweight API and DLL for CLP, CBC, and CGL
- CoinUtils: COIN-OR utilities, utilities, data structures, and linear algebra methods for COIN-OR projects
- Couenne: Couenne, a branch-and-bound algorithm for mixed integer nonlinear programming problems
- CppAD: CppAD, a tool for differentiation of C++ functions
- Crème: COIN-OR Relaxation Method, an implementation of the randomized thermal relaxation method to find a feasible solution of the Maximum Feasible Subsystem problem
- CSDP: CSDP, an interior-point method for semidefinite programming
- CyLP: Python interface to Cbc and Clp, a Python interface to Cbc and Clp
- DFO: Derivative-Free Optimization, a package for solving general nonlinear optimization problems when derivatives are unavailable
- DIP: Decomposition in Integer Programming , a framework for implementing a variety of decomposition-based branch-and-bound algorithms for solving mixed integer linear programs
- Djinni: Djinni, a templatized C++ framework with Python bindings for heuristic search
- DyLP: Dynamic LP, an implementation of the dynamic simplex methods
- filterSD: Subroutines for nonlinear optimization, a library for nonlinear optimization written in Fortran
- FLOPC++: FLOPC++, an algebraic modeling language embedded in C++
- GAMSlinks: GAMS/COIN-OR Links, links between GAMS (General Algebraic Modeling System) and solvers that are hosted at COIN-OR
- Ipopt: Interior-Point Optimizer, for general large-scale nonlinear optimization
- KSP: K Shortest Paths, algorithms for K shortest paths
- LaGO: Lagrangian Global Optimizer, for the global optimization of nonconvex mixed-integer nonlinear programs
- LEMON: Library of Efficient Models and Optimization in Networks, a C++ template library aimed at combinatorial optimization tasks, especially those working with graphs and networks
- MC++: Toolkit for Bounding Factorable Functions, provides methods for computing bounds on a factorable function, in the form of convex/concave relaxations, Taylor models, and spectral bounds
- METSlib: METSlib, an object oriented metaheuristics optimization framework and toolkit in C++
- MOCHA: Matroid Optimization: Combinatorial Heuristics and Algorithms, heuristics and algorithms for multicriteria matroid optimization
- NLPAPI: Nonlinear Programming API, a subroutine interface for defining and solving nonlinear programming problems
- oBB: Overlapping Branch and Bound, an algorithm for the parallel global optimization of functions with Lipchitz continuous gradient or Hessian
- OBOE: Oracle Based Optimization Engine, optimization of convex problems with user-supplied methods delivering key first order information (like support to the feasible set, support to the objective function)
- OptiML: Optimization for Machine learning, interior point, active set method and parametric solvers for support vector machines, solver for the sparse inverse covariance problem
- OSI: Open Solver Interface, a uniform API for calling embedded linear and mixed-integer programming solvers
- OTS: Open Tabu Search, a framework for constructing tabu search algorithms
- Paver: Paver, Python scripts to do comparisons of solver performance
- PFunc: Parallel Functions, a lightweight and portable library that provides C and C++ APIs to express task parallelism
- qpOASES: QP solver using the online active set strategy, an open-source C++ implementation of the recently proposed online active set strategy
- ROSE: Reformulation-Optimization Software Engine, software for performing symbolic reformulations to Mathematical Programs (MP)
- SMI: Stochastic Modeling Interface, for optimization under uncertainty
- SYMPHONY: SYMPHONY, a callable library for solving mixed-integer linear programs
- TestTools: TestTools, Python scripts to automatically download, configure, build, test, and install COIN-OR projects
- VOL: Volume Algorithm, a subgradient algorithm that also computes approximate primal solutions
- VRPH: VRP Heuristics, a library of heuristics for generating solutions to variants of the vehicle routing problem
- yaposib: Yet Another Python OSI Binding, a Python interface to linear solvers that use the OSI