**SCIP** contains several examples that demonstrate its usage. They are contained in the "examples" directory in the source code distribution.

#
Branch-and-price

Binpacking | An implementation of the column generation approach for the binpacking problem. It includes a customized reader, Ryan/Foster branching rule, (global) problem data, variable data, and constraint handler. |

**VRP** | A solver for a simple capacity-constrained vehicle routing problem, which is based on pricing tours via a dynamic programming algorithm. |

#
Branch-and-cut

Linear Ordering | An example for implementing a constraint handler. |

The TSP example | A short implementations of a constraint handler, two easy combinatorial heuristics, a file reader, etc. which demonstrate the usage of **SCIP** as a branch-and-cut-framework for solving traveling salesman problem instances. |

#
Callable library

Callable Library Example | An example showing how to setup constraints (esp. nonlinear ones) when using **SCIP** as callable library. |

MIP solver | A minimal implementation for using **SCIP** included into another source code |

**Queens** | An example showing the use of **SCIP** as callable library. |

#
Other plugins