Build (method = -2) #dp: 1309 Step-3' Graph: 70 vertices and 707 arcs (0.00s) Step-4' Graph: 65 vertices and 697 arcs (0.00s) #V4/#V3 = 0.93 #A4/#A3 = 0.99 Ready! (0.00s) Optimize a model with 106 rows, 698 columns and 1968 nonzeros Presolve removed 26 rows and 33 columns Presolve time: 0.02s Presolved: 80 rows, 665 columns, 1871 nonzeros Variable types: 0 continuous, 665 integer (408 binary) Found heuristic solution: objective 35.0000000 Found heuristic solution: objective 34.0000000 Found heuristic solution: objective 32.0000000 Optimize a model with 80 rows, 665 columns and 1871 nonzeros Presolved: 80 rows, 665 columns, 1871 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.010e+03 Factor NZ : 2.192e+03 Factor Ops : 7.463e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.22919441e+03 -1.96869913e+03 1.77e+03 1.61e-01 1.09e+01 0s 1 3.18493221e+02 -6.43041666e+02 3.22e+02 4.44e-16 2.13e+00 0s 2 7.75392417e+01 -1.58964078e+02 3.61e+01 5.55e-16 3.07e-01 0s 3 3.23356203e+01 -8.63034156e+00 1.53e+00 3.89e-16 3.44e-02 0s 4 2.51827466e+01 9.56822154e+00 3.93e-01 4.44e-16 1.22e-02 0s 5 2.34316601e+01 1.48912172e+01 1.91e-01 2.60e-16 6.52e-03 0s 6 2.17979424e+01 1.74427042e+01 6.12e-02 2.22e-16 3.28e-03 0s 7 2.12532970e+01 1.95106675e+01 2.51e-02 1.61e-16 1.31e-03 0s 8 2.09001614e+01 2.01214174e+01 8.71e-03 1.57e-16 5.83e-04 0s 9 2.07369693e+01 2.02452214e+01 3.46e-03 1.74e-16 3.68e-04 0s 10 2.06049737e+01 2.04398819e+01 3.25e-04 1.54e-16 1.24e-04 0s 11 2.05741254e+01 2.05161870e+01 7.35e-05 2.22e-16 4.34e-05 0s 12 2.05639144e+01 2.05490025e+01 1.04e-05 2.22e-16 1.12e-05 0s 13 2.05609793e+01 2.05570223e+01 7.99e-07 1.16e-16 2.96e-06 0s 14 2.05606248e+01 2.05605800e+01 2.52e-10 1.37e-16 3.35e-08 0s 15 2.05606061e+01 2.05606061e+01 5.60e-14 3.33e-16 5.60e-14 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 2.05606061e+01 Root relaxation: objective 2.056061e+01, 67 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.56061 0 39 32.00000 20.56061 35.7% - 0s H 0 0 22.0000000 20.56061 6.54% - 0s 0 0 20.75000 0 37 22.00000 20.75000 5.68% - 0s H 0 0 21.0000000 20.75000 1.19% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (224 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.100000000000e+01, best bound 2.100000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.08 seconds Total run time: 0.09 seconds Objective: 21 Solution: 1 x [15, 41] 1 x [16, 40] 1 x [17, 39] 1 x [18, 38] 1 x [11, 37] 1 x [20, 36] 1 x [19, 36] 1 x [4, 5, 35] 1 x [23, 34] 1 x [1, 11, 33] 1 x [24, 32] 1 x [7, 8, 32] 1 x [22, 31] 1 x [2, 13, 31] 1 x [9, 30] 1 x [25, 29] 1 x [26, 28] 1 x [3, 13, 27] 1 x [6, 15, 21] 1 x [10, 14, 21] 1 x [12, 12, 19]