Build (method = -2) #dp: 3774 Step-3' Graph: 59 vertices and 744 arcs (0.02s) Step-4' Graph: 48 vertices and 722 arcs (0.02s) #V4/#V3 = 0.81 #A4/#A3 = 0.97 Ready! (0.02s) Optimize a model with 88 rows, 723 columns and 2082 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.01s Presolved: 86 rows, 721 columns, 2078 nonzeros Variable types: 0 continuous, 721 integer (37 binary) Found heuristic solution: objective 239.0000000 Optimize a model with 86 rows, 721 columns and 2078 nonzeros Presolved: 86 rows, 721 columns, 2078 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.002e+03 Factor NZ : 2.190e+03 Factor Ops : 7.127e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.05752158e+03 -9.24737179e+03 6.39e+03 8.27e-02 6.37e+01 0s 1 1.04577617e+03 -4.14134572e+03 9.71e+02 1.89e-15 1.11e+01 0s 2 2.84370767e+02 -1.73925680e+03 7.44e+01 1.78e-15 1.81e+00 0s 3 1.69974821e+02 -3.37608400e+02 3.28e+00 1.39e-15 3.51e-01 0s 4 7.95561748e+01 -1.04639378e+02 3.67e-01 1.14e-15 1.25e-01 0s 5 5.90000544e+01 3.25190452e+00 1.84e-01 1.50e-15 3.78e-02 0s 6 5.40697542e+01 2.24409355e+01 9.78e-02 1.51e-15 2.14e-02 0s 7 4.91986778e+01 3.71650355e+01 3.41e-02 1.67e-15 8.14e-03 0s 8 4.71226946e+01 4.38345036e+01 9.79e-03 1.05e-15 2.22e-03 0s 9 4.63893953e+01 4.56468291e+01 6.93e-04 1.01e-15 5.02e-04 0s 10 4.63335875e+01 4.63313979e+01 4.05e-14 1.16e-15 1.48e-06 0s 11 4.63333336e+01 4.63333314e+01 6.29e-14 1.33e-15 1.48e-09 0s 12 4.63333333e+01 4.63333333e+01 3.46e-13 1.44e-15 1.48e-12 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 4.63333333e+01 Root relaxation: objective 4.633333e+01, 549 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 46.33333 0 18 239.00000 46.33333 80.6% - 0s H 0 0 49.0000000 46.33333 5.44% - 0s H 0 0 47.0000000 46.33333 1.42% - 0s Explored 0 nodes (779 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.700000000000e+01, best bound 4.700000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.04 seconds Total run time: 0.07 seconds Objective: 47 Solution: 3 x [3, 14, 30, 39] 4 x [6, 11, 27, 34, 39] 3 x [5, 6, 10, 19, 39] 3 x [10, 14, 28, 30, 35] 3 x [1, 12, 16, 16, 26, 30] 1 x [1, 5, 19, 20] 2 x [6, 9, 11, 13, 40] 1 x [2, 6, 9, 13, 34] 4 x [3, 4, 17, 24, 40] 1 x [1, 2, 3, 4, 5, 15] 1 x [9, 19, 31, 33, 40] 1 x [3, 9, 13, 31, 40] 2 x [1, 9, 12, 16, 16, 23] 1 x [12, 22, 23, 25, 32, 36] 1 x [22, 23, 25, 36, 38] 3 x [13, 13, 14, 23, 23, 38] 3 x [5, 12, 15, 15, 17, 21] 4 x [8, 18, 21, 36, 37, 38] 1 x [18, 18, 26, 26, 29, 36] 1 x [8, 21, 21, 28, 38, 38] 4 x [7, 7, 8, 18, 22, 29]