Build (method = -2) #dp: 7973 Step-3' Graph: 106 vertices and 812 arcs (0.04s) Step-4' Graph: 51 vertices and 702 arcs (0.04s) #V4/#V3 = 0.48 #A4/#A3 = 0.86 Ready! (0.04s) Optimize a model with 111 rows, 703 columns and 2014 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.01s Presolved: 109 rows, 701 columns, 2010 nonzeros Variable types: 0 continuous, 701 integer (41 binary) Found heuristic solution: objective 1013.0000000 Found heuristic solution: objective 981.0000000 Optimize a model with 109 rows, 701 columns and 2010 nonzeros Presolved: 109 rows, 701 columns, 2010 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.152e+03 Factor NZ : 2.397e+03 Factor Ops : 7.377e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.91051730e+04 -5.96005004e+04 2.74e+04 7.46e-02 4.64e+02 0s 1 8.89924241e+03 -1.50883816e+04 3.69e+03 1.55e-15 6.50e+01 0s 2 1.90407780e+03 -6.05380195e+03 4.38e+02 3.35e-14 1.05e+01 0s 3 8.68277269e+02 -1.43779950e+03 2.57e+01 9.44e-15 1.74e+00 0s 4 4.16477946e+02 -3.74052516e+02 1.99e+00 2.89e-15 5.48e-01 0s 5 3.16704777e+02 -7.50287056e+01 9.85e-01 1.33e-15 2.71e-01 0s 6 2.75080135e+02 1.23859171e+02 4.31e-01 6.07e-16 1.04e-01 0s 7 2.62748187e+02 2.37078785e+02 1.58e-01 6.66e-16 1.76e-02 0s 8 2.55546671e+02 2.55236173e+02 8.25e-13 6.06e-16 2.13e-04 0s 9 2.55500001e+02 2.55499991e+02 5.43e-13 6.69e-16 6.45e-09 0s 10 2.55500000e+02 2.55500000e+02 5.48e-13 4.44e-16 6.45e-12 0s Barrier solved model in 10 iterations and 0.01 seconds Optimal objective 2.55500000e+02 Root relaxation: objective 2.555000e+02, 575 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 255.50000 0 11 981.00000 255.50000 74.0% - 0s H 0 0 257.0000000 255.50000 0.58% - 0s H 0 0 256.0000000 255.50000 0.20% - 0s Explored 0 nodes (719 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.560000000000e+02, best bound 2.560000000000e+02, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.04 seconds Total run time: 0.09 seconds Objective: 256 Solution: 1 x [3, 9, 30, 58] 5 x [1, 12, 42, 58] 22 x [23, 45, 49, 55] 2 x [9, 15, 45, 46] 10 x [45, 46, 47, 50] 26 x [29, 34, 52, 59] 1 x [3, 9, 29] 8 x [14, 27, 29, 46] 13 x [8, 25, 38, 51] 1 x [23, 25, 59, 60] 6 x [4, 25, 25, 59] 2 x [9, 31, 43, 44] 2 x [22, 31, 40, 60] 5 x [11, 26, 32, 48] 1 x [13, 39, 48, 50] 17 x [11, 39, 43, 48] 5 x [26, 33, 39, 57] 2 x [26, 39, 50, 56] 7 x [18, 27, 32, 33] 12 x [10, 28, 32, 33] 9 x [13, 41, 54, 55] 1 x [11, 13, 22, 41] 19 x [9, 35, 37, 40] 6 x [13, 21, 21, 44] 8 x [1, 1, 12, 13] 6 x [5, 9, 30, 42] 3 x [3, 5, 9, 30] 5 x [8, 16, 36, 37] 1 x [6, 21, 44] 22 x [4, 12, 19, 56] 2 x [7, 32, 34, 51] 17 x [17, 24, 27, 53] 1 x [11, 17, 20, 36] 1 x [2, 34, 37, 55] 5 x [11, 17, 20, 24] 2 x [22, 23, 28, 34]