The problem

The example solves the following integer linear program with ten binary variables $x_0, \ldots, x_9$ (indices taken modulo 10):

$$\begin{array}{llrrrrrrrrrrr} {\rm Minimize} &\displaystyle \... ... x_i \in \{0, 1\} &&&{\rm for } i = 0, \ldots, 9. \end{array}$$

The formulation is a little bit silly, as constraints $x_i + x_{i+1} \le 1$ are implied by $x_i + x_{i+1} + x_{i+2} \le 1$ and could thus be removed. However, since the purpose of this example is more to illustrate a few features of BCP than solving a mathematically interesting problem, this should be good enough.

Despite the apparent triviality of this integer linear program, the output of the code depends on the compilation flags in use (see Section 4 for the possible compilation flags).