Build (method = -2) #dp: 2734 Step-3' Graph: 115 vertices and 402 arcs (0.01s) Step-4' Graph: 74 vertices and 320 arcs (0.01s) #V4/#V3 = 0.64 #A4/#A3 = 0.80 Ready! (0.01s) Optimize a model with 84 rows, 321 columns and 825 nonzeros Presolve removed 17 rows and 35 columns Presolve time: 0.00s Presolved: 67 rows, 286 columns, 761 nonzeros Variable types: 0 continuous, 286 integer (0 binary) Found heuristic solution: objective 998.0000000 Found heuristic solution: objective 936.0000000 Found heuristic solution: objective 781.0000000 Found heuristic solution: objective 762.0000000 Optimize a model with 67 rows, 286 columns and 761 nonzeros Presolved: 67 rows, 286 columns, 761 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.260e+02 Factor NZ : 1.377e+03 Factor Ops : 3.264e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.40607928e+03 -3.84491380e+04 3.82e+04 2.22e-16 4.44e+02 0s 1 2.22628396e+03 -1.66446103e+04 6.92e+03 5.55e-16 8.49e+01 0s 2 9.89223011e+02 -5.02068504e+03 8.51e+02 7.77e-16 1.47e+01 0s 3 5.83891927e+02 -9.85039077e+02 5.98e-01 3.33e-16 2.70e+00 0s 4 3.77815802e+02 -3.11119007e+02 3.22e-01 3.33e-16 1.18e+00 0s 5 2.51884769e+02 -9.23645320e+01 1.76e-01 1.82e-16 5.92e-01 0s 6 1.67625810e+02 4.63037003e+00 6.20e-02 2.23e-16 2.80e-01 0s 7 1.56862747e+02 1.12634170e+02 3.63e-02 3.33e-16 7.60e-02 0s 8 1.43835586e+02 1.41137995e+02 4.50e-14 2.01e-16 4.64e-03 0s 9 1.42859114e+02 1.42852996e+02 2.02e-13 2.22e-16 1.05e-05 0s 10 1.42857145e+02 1.42857139e+02 3.90e-13 2.22e-16 1.05e-08 0s 11 1.42857143e+02 1.42857143e+02 2.17e-12 2.22e-16 1.05e-11 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.42857143e+02 Root relaxation: objective 1.428571e+02, 178 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 15 762.00000 142.85714 81.3% - 0s H 0 0 143.0000000 142.85714 0.10% - 0s Explored 0 nodes (312 simplex iterations) in 0.01 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.01 seconds Total run time: 0.03 seconds Objective: 143 Solution: 33 x [3, 4, 6, 7, 7, 8, 9] 9 x [3, 4, 7, 7, 9, 10, 10] 3 x [3, 4, 7, 7, 8, 10, 10] 5 x [1, 2, 3, 6, 7, 8, 10] 1 x [2, 3, 6, 7, 8, 10] 1 x [2, 3, 7, 7, 8, 10, 10] 12 x [2, 3, 8, 8, 8, 10, 10] 1 x [2, 2, 3, 6, 7, 8, 10] 56 x [1, 3, 3, 7, 7, 8, 10] 22 x [5, 5, 5, 5, 5, 5, 5]