Build (method = -2) #dp: 1915 Step-3' Graph: 117 vertices and 384 arcs (0.01s) Step-4' Graph: 67 vertices and 284 arcs (0.01s) #V4/#V3 = 0.57 #A4/#A3 = 0.74 Ready! (0.01s) Optimize a model with 76 rows, 285 columns and 731 nonzeros Presolve removed 18 rows and 35 columns Presolve time: 0.00s Presolved: 58 rows, 250 columns, 676 nonzeros Variable types: 0 continuous, 250 integer (0 binary) Found heuristic solution: objective 689.0000000 Optimize a model with 58 rows, 250 columns and 676 nonzeros Presolved: 58 rows, 250 columns, 676 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.760e+02 Factor NZ : 1.022e+03 Factor Ops : 2.069e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.61081325e+03 -4.03582582e+04 3.61e+04 1.11e-16 5.15e+02 0s 1 2.50183469e+03 -1.66224394e+04 7.23e+03 7.77e-16 1.04e+02 0s 2 9.92662508e+02 -5.54818057e+03 7.11e+02 5.00e-16 1.76e+01 0s 3 5.94609631e+02 -1.54236928e+03 6.86e-01 3.89e-16 4.20e+00 0s 4 3.66720443e+02 -8.78253922e+02 2.57e-01 2.22e-16 2.45e+00 0s 5 2.01493572e+02 -1.27383492e+02 8.00e-02 2.64e-16 6.46e-01 0s 6 1.92741567e+02 -6.98919015e+01 4.88e-02 2.22e-16 5.16e-01 0s 7 1.63620498e+02 8.53296144e+01 2.50e-02 1.94e-16 1.54e-01 0s 8 1.45325453e+02 1.36229024e+02 1.67e-04 2.22e-16 1.79e-02 0s 9 1.42863393e+02 1.42838035e+02 3.02e-07 2.22e-16 4.98e-05 0s 10 1.42857149e+02 1.42857124e+02 1.25e-12 2.86e-16 4.98e-08 0s 11 1.42857143e+02 1.42857143e+02 2.11e-12 4.44e-16 4.98e-11 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.42857143e+02 Root relaxation: objective 1.428571e+02, 148 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 142.85714 0 22 689.00000 142.85714 79.3% - 0s H 0 0 144.0000000 142.85714 0.79% - 0s 0 0 142.85714 0 31 144.00000 142.85714 0.79% - 0s H 0 0 143.0000000 142.85714 0.10% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (197 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.430000000000e+02, best bound 1.430000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 143 Solution: 1 x [1, 1, 6, 6, 8, 9, 9] 1 x [1, 1, 2, 3, 5, 7, 9] 53 x [1, 1, 1, 2, 4, 4, 8] 23 x [1, 1, 1, 5, 6, 6, 9] 29 x [4, 5, 5, 6, 7, 8, 9] 6 x [2, 3, 5, 5, 7, 8, 9] 1 x [2, 7, 8, 8, 9, 9, 9] 12 x [2, 4, 5, 5, 5, 5, 5] 15 x [4, 4, 5, 5, 5, 5, 5] 1 x [2, 3, 5, 5, 5, 5, 5] 1 x [2, 5, 5, 5, 5, 5]