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. |

**Coloring** | An implemenation of the column generation approach for graph coloring of Mehrotra and Trick. |

**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

**LOP** | An example for implementing a constraint handler. |

**TSP** | 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

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

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

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

#
Other plugins

**Eventhdlr** | A small example illustrating the use of an event handler. |

**Scheduler** | An example containing three readers and one primal heuristic for scheduling problems. |

**GMI** | An example about Gomory mixed-integer cuts. |