Build (method = -2) #dp: 5423 Step-3' Graph: 364 vertices and 2040 arcs (0.04s) Step-4' Graph: 360 vertices and 2032 arcs (0.04s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.04s) Optimize a model with 370 rows, 2033 columns and 5405 nonzeros Presolve removed 19 rows and 36 columns Presolve time: 0.02s Presolved: 351 rows, 1997 columns, 5355 nonzeros Variable types: 0 continuous, 1997 integer (0 binary) Found heuristic solution: objective 834.0000000 Found heuristic solution: objective 588.0000000 Optimize a model with 351 rows, 1997 columns and 5355 nonzeros Presolved: 351 rows, 1997 columns, 5355 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.264e+03 Factor NZ : 1.636e+04 (roughly 1 MByte of memory) Factor Ops : 1.155e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.22483844e+03 -4.13311413e+05 2.27e+05 2.22e-16 6.65e+02 0s 1 1.85665167e+03 -2.79897987e+05 3.68e+04 5.55e-16 1.53e+02 0s 2 1.48377881e+03 -1.16098076e+05 1.36e+04 4.00e-15 5.26e+01 0s 3 1.13726472e+03 -2.41989207e+04 3.27e+03 1.78e-15 1.08e+01 0s 4 9.91234706e+02 -6.56119192e+03 1.07e+01 3.24e-14 1.90e+00 0s 5 9.80815164e+02 -1.56104306e+03 5.05e-03 1.11e-14 6.36e-01 0s 6 8.31278179e+02 -1.51350502e+03 3.35e-03 1.09e-14 5.86e-01 0s 7 6.55942893e+02 -1.02469748e+03 2.33e-03 6.88e-15 4.20e-01 0s 8 4.42042529e+02 -4.53103761e+02 1.48e-03 3.22e-15 2.24e-01 0s 9 2.15722357e+02 -2.82705784e+02 5.44e-04 2.00e-15 1.24e-01 0s 10 1.28147207e+02 -1.22217203e+02 2.20e-04 8.88e-16 6.25e-02 0s 11 1.16792662e+02 -2.04924137e+01 1.25e-04 6.66e-16 3.43e-02 0s 12 1.09884749e+02 4.20280980e+01 7.61e-05 3.25e-16 1.69e-02 0s 13 1.02787503e+02 6.58812191e+01 3.55e-05 2.90e-16 9.22e-03 0s 14 1.00356297e+02 7.61124733e+01 2.49e-05 2.58e-16 6.05e-03 0s 15 9.66797297e+01 8.66515608e+01 6.76e-06 3.24e-16 2.50e-03 0s 16 9.52049713e+01 9.19772481e+01 1.25e-06 2.22e-16 8.06e-04 0s 17 9.47037711e+01 9.39326007e+01 1.80e-07 2.34e-16 1.93e-04 0s 18 9.46025607e+01 9.44804029e+01 2.54e-08 3.33e-16 3.05e-05 0s 19 9.45803362e+01 9.45791599e+01 2.68e-10 3.33e-16 2.94e-07 0s 20 9.45800000e+01 9.45800000e+01 4.23e-12 2.83e-16 4.42e-13 0s Barrier solved model in 20 iterations and 0.05 seconds Optimal objective 9.45800000e+01 Root relaxation: objective 9.458000e+01, 857 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 94.58000 0 67 588.00000 94.58000 83.9% - 0s H 0 0 96.0000000 94.58000 1.48% - 0s H 0 0 95.0000000 94.58000 0.44% - 0s Explored 0 nodes (2007 simplex iterations) in 0.21 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.500000000000e+01, best bound 9.500000000000e+01, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.21 seconds Total run time: 0.27 seconds Objective: 95 Solution: 4 x [1, 3, 5, 5, 7, 8, 9, 9] 2 x [5, 6, 6, 8, 9, 9, 9, 10] 5 x [5, 8, 8, 8, 9, 9, 9, 10] 3 x [3, 6, 9, 9, 9, 9] 1 x [3, 5, 5, 5, 7, 8, 10, 10, 10] 7 x [1, 1, 1, 3, 4, 6, 6, 7, 7, 7, 10, 10, 10] 5 x [1, 3, 4, 6, 7, 7, 7, 7, 10, 10, 10, 10, 10] 15 x [1, 2, 2, 3, 3, 3, 3] 21 x [3, 3, 3, 3, 6, 6, 7, 7] 3 x [1, 2, 4, 5, 5, 5, 7, 7, 8, 8, 8] 3 x [1, 1, 1, 1, 1, 5, 6, 6, 7, 8, 8, 8, 10] 1 x [4, 5, 5, 7, 7, 8, 8, 8, 10] 2 x [5, 5, 5, 7, 7, 8, 8, 8, 8, 8, 10] 3 x [5, 5, 5, 6, 8, 8, 8, 8, 8, 8, 10] 20 x [1, 1, 1, 1, 1, 4, 4, 4, 4, 4, 4, 6, 7, 8, 8, 8]