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.