Build (method = -2) #dp: 1834 Step-3' Graph: 145 vertices and 482 arcs (0.01s) Step-4' Graph: 90 vertices and 372 arcs (0.01s) #V4/#V3 = 0.62 #A4/#A3 = 0.77 Ready! (0.01s) Optimize a model with 98 rows, 373 columns and 951 nonzeros Presolve removed 23 rows and 43 columns Presolve time: 0.00s Presolved: 75 rows, 330 columns, 880 nonzeros Variable types: 0 continuous, 330 integer (34 binary) Found heuristic solution: objective 46.0000000 Optimize a model with 75 rows, 330 columns and 880 nonzeros Presolved: 75 rows, 330 columns, 880 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.010e+02 Factor NZ : 1.611e+03 Factor Ops : 4.048e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.28712865e+02 -5.48909352e+03 4.66e+03 5.20e-02 4.32e+01 0s 1 2.07633788e+02 -2.42437545e+03 8.03e+02 5.00e-16 8.55e+00 0s 2 1.12132155e+02 -6.77963910e+02 1.18e+02 5.55e-16 1.64e+00 0s 3 7.83555898e+01 -9.55927317e+01 1.37e+01 3.67e-16 2.88e-01 0s 4 4.39690744e+01 -4.14547304e+01 4.78e+00 2.76e-16 1.36e-01 0s 5 3.33529861e+01 -1.72252184e+01 3.51e+00 2.48e-16 8.15e-02 0s 6 1.75010178e+01 -6.77883370e+00 1.47e+00 2.04e-16 3.86e-02 0s 7 1.25183941e+01 1.99024067e+00 5.29e-01 2.50e-16 1.64e-02 0s 8 1.29661863e+01 7.52546604e+00 4.47e-01 2.22e-16 8.51e-03 0s 9 1.13495980e+01 1.04008888e+01 5.15e-02 2.05e-16 1.45e-03 0s 10 1.11127913e+01 1.11001862e+01 4.58e-05 4.44e-16 1.89e-05 0s 11 1.11111128e+01 1.11111002e+01 1.12e-13 2.70e-16 1.89e-08 0s 12 1.11111111e+01 1.11111111e+01 9.83e-14 3.10e-16 1.89e-11 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 1.11111111e+01 Root relaxation: objective 1.111111e+01, 174 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.11111 0 27 46.00000 11.11111 75.8% - 0s H 0 0 13.0000000 11.11111 14.5% - 0s 0 0 11.11111 0 33 13.00000 11.11111 14.5% - 0s H 0 0 12.0000000 11.11111 7.41% - 0s Cutting planes: Gomory: 1 Zero half: 1 Explored 0 nodes (295 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+01, best bound 1.200000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.03 seconds Total run time: 0.05 seconds Objective: 12 Solution: 1 x [1, 4, 5, 5, 5, 6, 6, 7] 1 x [1, 3, 3, 3, 4, 6, 7, 7, 8] 1 x [1, 2, 5, 7, 7, 7, 7] 1 x [4, 4, 6, 6, 6, 7, 7] 3 x [2, 2, 3, 3, 3, 4, 4, 4, 4] 3 x [2, 2, 2, 5, 6, 6, 6, 6, 7] 1 x [6, 6, 6, 7, 7, 7, 7] 1 x [2, 3, 5, 5, 5, 5, 6, 6]