Build (method = -2) #dp: 8936 Step-3' Graph: 136 vertices and 2501 arcs (0.04s) Step-4' Graph: 90 vertices and 2409 arcs (0.05s) #V4/#V3 = 0.66 #A4/#A3 = 0.96 Ready! (0.05s) Optimize a model with 210 rows, 2410 columns and 7054 nonzeros Presolve removed 10 rows and 10 columns Presolve time: 0.03s Presolved: 200 rows, 2400 columns, 6561 nonzeros Variable types: 0 continuous, 2400 integer (2254 binary) Found heuristic solution: objective 113.0000000 Optimize a model with 200 rows, 2400 columns and 6561 nonzeros Presolved: 200 rows, 2400 columns, 6561 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.460e+03 Factor NZ : 6.786e+03 (roughly 1 MByte of memory) Factor Ops : 3.589e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.05305070e+03 -1.31978016e+04 3.08e+04 3.06e-01 1.96e+01 0s 1 1.41974558e+03 -2.62706965e+03 4.06e+03 7.77e-16 2.72e+00 0s 2 1.96347848e+02 -2.72366487e+02 3.85e+02 6.66e-16 2.72e-01 0s 3 6.19763155e+01 -1.27398662e+01 2.83e+01 3.33e-16 2.80e-02 0s 4 4.98840015e+01 1.81796045e+01 4.80e+00 4.44e-16 8.18e-03 0s 5 4.46249001e+01 3.51893967e+01 1.20e+00 1.38e-16 2.17e-03 0s 6 4.20022212e+01 3.77825052e+01 3.53e-01 2.22e-16 9.25e-04 0s 7 4.12131589e+01 3.89257794e+01 1.76e-01 2.22e-16 4.96e-04 0s 8 4.04508995e+01 3.93050878e+01 5.24e-02 2.22e-16 2.44e-04 0s 9 4.02284182e+01 3.97020800e+01 2.31e-02 4.44e-16 1.12e-04 0s 10 4.00518886e+01 3.98890140e+01 2.82e-03 4.44e-16 3.42e-05 0s 11 4.00194962e+01 3.99554850e+01 9.35e-04 1.12e-16 1.34e-05 0s 12 4.00036026e+01 3.99897846e+01 1.12e-04 1.99e-16 2.89e-06 0s 13 4.00000702e+01 3.99999391e+01 8.36e-15 4.44e-16 2.73e-08 0s 14 4.00000001e+01 3.99999999e+01 1.63e-14 2.22e-16 2.74e-11 0s Barrier solved model in 14 iterations and 0.02 seconds Optimal objective 4.00000001e+01 Root relaxation: objective 4.000000e+01, 389 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 40.0000000 40.00000 0.0% - 0s Explored 0 nodes (748 simplex iterations) in 0.11 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.000000000000e+01, best bound 4.000000000000e+01, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.11 seconds Total run time: 0.17 seconds Objective: 40 Solution: 1 x [2, 4, 77] 1 x [5, 33, 118] 1 x [26, 31, 101] 1 x [59, 104, 115] 1 x [25, 29, 102] 1 x [6, 71, 100] 1 x [17, 22, 117] 1 x [16, 23, 68] 1 x [8, 34, 83] 1 x [13, 24, 110] 1 x [1, 11, 14] 1 x [9, 20, 49] 1 x [7, 50, 51] 1 x [3, 95, 106] 1 x [88, 89, 111] 1 x [80, 98, 103] 1 x [58, 99, 116] 1 x [36, 40, 42] 1 x [27, 72, 112] 1 x [62, 73, 90] 1 x [56, 70, 75] 1 x [44, 46, 48] 1 x [41, 105, 109] 1 x [28, 35, 57] 1 x [64, 87, 108] 1 x [12, 32, 85] 1 x [37, 60, 86] 1 x [30, 38, 55] 1 x [15, 93, 97] 1 x [18, 76, 81] 1 x [10, 21, 74] 1 x [79, 91, 113] 1 x [19, 65, 78] 1 x [43, 63, 119] 1 x [82, 84, 120] 1 x [61, 69, 107] 1 x [47, 52, 96] 1 x [39, 92, 94] 1 x [53, 54, 67] 1 x [45, 66, 114]