Build (method = -2) #dp: 3234 Step-3' Graph: 90 vertices and 1413 arcs (0.01s) Step-4' Graph: 81 vertices and 1395 arcs (0.02s) #V4/#V3 = 0.90 #A4/#A3 = 0.99 Ready! (0.02s) Optimize a model with 149 rows, 1396 columns and 4032 nonzeros Presolve removed 29 rows and 38 columns Presolve time: 0.03s Presolved: 120 rows, 1358 columns, 3900 nonzeros Variable types: 0 continuous, 1358 integer (266 binary) Found heuristic solution: objective 174.0000000 Found heuristic solution: objective 156.0000000 Optimize a model with 120 rows, 1358 columns and 3900 nonzeros Presolved: 120 rows, 1358 columns, 3900 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.089e+03 Factor NZ : 4.114e+03 Factor Ops : 1.922e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.08076134e+03 -1.36282537e+04 2.50e+04 1.11e-01 5.60e+01 0s 1 9.52516054e+02 -4.21234454e+03 3.36e+03 8.88e-16 8.24e+00 0s 2 2.82920242e+02 -1.56743696e+03 2.89e+02 1.74e-14 1.13e+00 0s 3 1.77121713e+02 -3.32039585e+02 2.51e+01 6.22e-15 2.10e-01 0s 4 1.42561390e+02 -1.28352803e+02 6.65e+00 2.89e-15 1.04e-01 0s 5 1.15909786e+02 -2.52833808e+00 3.00e+00 1.11e-15 4.47e-02 0s 6 1.00818387e+02 3.40504787e+01 1.18e+00 1.10e-15 2.48e-02 0s 7 9.52137354e+01 6.60991784e+01 5.98e-01 8.47e-16 1.08e-02 0s 8 9.16145835e+01 7.95631908e+01 1.70e-01 8.88e-16 4.41e-03 0s 9 9.04056110e+01 8.29594231e+01 5.21e-02 7.77e-16 2.71e-03 0s 10 8.99495430e+01 8.80016826e+01 2.38e-02 1.44e-15 7.11e-04 0s 11 8.95288272e+01 8.92187716e+01 1.02e-03 7.77e-16 1.13e-04 0s 12 8.95010320e+01 8.94968529e+01 9.03e-13 8.88e-16 1.52e-06 0s 13 8.95000000e+01 8.95000000e+01 7.82e-14 9.04e-16 1.67e-11 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 8.95000000e+01 Root relaxation: objective 8.950000e+01, 513 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 89.50000 0 23 156.00000 89.50000 42.6% - 0s H 0 0 90.0000000 89.50000 0.56% - 0s Explored 0 nodes (562 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.000000000000e+01, best bound 9.000000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.08 seconds Total run time: 0.11 seconds Objective: 90 Solution: 2 x [20, 68] 3 x [15, 67] 3 x [14, 66] 4 x [22, 65] 5 x [23, 64] 4 x [21, 63] 2 x [24, 62] 1 x [26, 61] 1 x [22, 61] 1 x [24, 60] 1 x [21, 60] 3 x [26, 59] 4 x [30, 58] 3 x [28, 57] 3 x [29, 56] 1 x [14, 55] 4 x [31, 54] 2 x [34, 53] 1 x [27, 53] 3 x [33, 52] 1 x [32, 52] 1 x [35, 51] 2 x [32, 51] 1 x [2, 6, 51] 1 x [2, 51] 1 x [36, 50] 3 x [3, 7, 50] 1 x [4, 6, 50] 1 x [37, 49] 1 x [1, 10, 49] 1 x [2, 8, 49] 1 x [4, 7, 49] 2 x [38, 48] 2 x [1, 11, 48] 2 x [39, 47] 2 x [40, 46] 3 x [41, 45] 1 x [42, 44] 1 x [43, 43] 2 x [5, 13, 42] 1 x [9, 12, 39] 1 x [10, 11, 39] 1 x [16, 17, 28] 2 x [18, 19, 25] 1 x [13, 13, 23] 1 x [16, 16, 21] 1 x [15, 19] 1 x [12, 14, 15]