Build (method = -2) #dp: 4149 Step-3' Graph: 105 vertices and 723 arcs (0.02s) Step-4' Graph: 63 vertices and 639 arcs (0.02s) #V4/#V3 = 0.60 #A4/#A3 = 0.88 Ready! (0.02s) Optimize a model with 123 rows, 640 columns and 1798 nonzeros Presolve removed 27 rows and 30 columns Presolve time: 0.01s Presolved: 96 rows, 610 columns, 1718 nonzeros Variable types: 0 continuous, 610 integer (233 binary) Found heuristic solution: objective 82.0000000 Found heuristic solution: objective 81.0000000 Optimize a model with 96 rows, 610 columns and 1718 nonzeros Presolved: 96 rows, 610 columns, 1718 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.208e+03 Factor NZ : 2.654e+03 Factor Ops : 8.740e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.85010004e+03 -5.79755599e+03 6.58e+03 2.23e-01 4.57e+01 0s 1 9.08178866e+02 -1.42740804e+03 1.14e+03 5.00e-16 7.93e+00 0s 2 1.59663546e+02 -4.89127529e+02 8.92e+01 8.88e-16 9.43e-01 0s 3 8.01762562e+01 -8.89317473e+01 7.04e+00 7.77e-16 1.58e-01 0s 4 5.64736732e+01 6.33470991e+00 9.50e-01 4.44e-16 4.18e-02 0s 5 4.85758740e+01 2.62187325e+01 3.29e-01 2.22e-16 1.83e-02 0s 6 4.54831906e+01 3.38564871e+01 1.65e-01 2.22e-16 9.46e-03 0s 7 4.29250356e+01 3.80066768e+01 5.53e-02 1.15e-16 3.99e-03 0s 8 4.20641473e+01 4.06541412e+01 1.18e-02 2.22e-16 1.14e-03 0s 9 4.18726369e+01 4.11228906e+01 6.23e-03 1.34e-16 6.06e-04 0s 10 4.17077228e+01 4.13555874e+01 2.02e-03 1.11e-16 2.84e-04 0s 11 4.16407616e+01 4.14777950e+01 5.69e-04 1.27e-16 1.32e-04 0s 12 4.16094907e+01 4.15447307e+01 1.60e-04 1.11e-16 5.23e-05 0s 13 4.15992536e+01 4.15692470e+01 6.31e-05 2.22e-16 2.42e-05 0s 14 4.15949765e+01 4.15781297e+01 3.08e-05 2.22e-16 1.36e-05 0s 15 4.15920621e+01 4.15862196e+01 8.08e-06 2.22e-16 4.72e-06 0s 16 4.15909977e+01 4.15906781e+01 1.26e-07 4.44e-16 2.58e-07 0s 17 4.15909099e+01 4.15909075e+01 3.14e-10 3.33e-16 1.94e-09 0s 18 4.15909091e+01 4.15909091e+01 1.96e-12 3.33e-16 1.94e-12 0s Barrier solved model in 18 iterations and 0.01 seconds Optimal objective 4.15909091e+01 Root relaxation: objective 4.159091e+01, 37 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 41.59091 0 47 81.00000 41.59091 48.7% - 0s H 0 0 43.0000000 41.59091 3.28% - 0s H 0 0 42.0000000 41.59091 0.97% - 0s Explored 0 nodes (85 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.200000000000e+01, best bound 4.200000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.04 seconds Total run time: 0.07 seconds Objective: 42 Solution: 1 x [12, 60] 2 x [6, 8, 59] 1 x [7, 7, 58] 2 x [15, 57] 2 x [16, 56] 2 x [20, 55] 1 x [1, 19, 55] 1 x [21, 54] 1 x [5, 17, 53] 2 x [23, 52] 1 x [4, 21, 51] 1 x [2, 51] 1 x [25, 50] 1 x [24, 50] 1 x [26, 49] 1 x [10, 14, 48] 1 x [27, 47] 1 x [27, 46] 1 x [29, 45] 1 x [28, 45] 2 x [31, 44] 1 x [35, 43] 1 x [14, 18, 42] 2 x [37, 41] 1 x [37, 40] 1 x [3, 36, 40] 2 x [38, 39] 1 x [15, 24, 37] 1 x [9, 34, 35] 1 x [11, 32, 33] 1 x [7, 30, 33] 1 x [13, 28, 30] 1 x [22, 22, 30] 1 x [24, 24, 28]