Academic license - for non-commercial use only
Optimize a model with 75 rows, 125 columns and 375 nonzeros
Variable types: 0 continuous, 125 integer (125 binary)
Coefficient statistics:
  Matrix range     [1e+00, 1e+00]
  Objective range  [0e+00, 0e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [1e+00, 1e+00]
Found heuristic solution: objective 0.0000000

Explored 0 nodes (0 simplex iterations) in 0.00 seconds
Thread count was 1 (of 4 available processors)

Solution count 1: 0

Optimal solution found (tolerance 1.00e-04)
Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000%

    Variable            X
-------------------------
cell_i_j_coloured_k[0,0,1]            1
cell_i_j_coloured_k[0,1,4]            1
cell_i_j_coloured_k[0,2,0]            1
cell_i_j_coloured_k[0,3,3]            1
cell_i_j_coloured_k[0,4,2]            1
cell_i_j_coloured_k[1,0,2]            1
cell_i_j_coloured_k[1,1,1]            1
cell_i_j_coloured_k[1,2,4]            1
cell_i_j_coloured_k[1,3,0]            1
cell_i_j_coloured_k[1,4,3]            1
cell_i_j_coloured_k[2,0,3]            1
cell_i_j_coloured_k[2,1,0]            1
cell_i_j_coloured_k[2,2,2]            1
cell_i_j_coloured_k[2,3,4]            1
cell_i_j_coloured_k[2,4,1]            1
cell_i_j_coloured_k[3,0,0]            1
cell_i_j_coloured_k[3,1,2]            1
cell_i_j_coloured_k[3,2,3]            1
cell_i_j_coloured_k[3,3,1]            1
cell_i_j_coloured_k[3,4,4]            1
cell_i_j_coloured_k[4,0,4]            1
cell_i_j_coloured_k[4,1,3]            1
cell_i_j_coloured_k[4,2,1]            1
cell_i_j_coloured_k[4,3,2]            1
cell_i_j_coloured_k[4,4,0]            1



1 4 0 3 2
2 1 4 0 3
3 0 2 4 1
0 2 3 1 4
4 3 1 2 0