Build (method = -2) #dp: 11019 Step-3' Graph: 224 vertices and 965 arcs (0.06s) Step-4' Graph: 129 vertices and 775 arcs (0.06s) #V4/#V3 = 0.58 #A4/#A3 = 0.80 Ready! (0.06s) Optimize a model with 144 rows, 776 columns and 2080 nonzeros Presolve removed 12 rows and 27 columns Presolve time: 0.01s Presolved: 132 rows, 749 columns, 2031 nonzeros Variable types: 0 continuous, 749 integer (0 binary) Found heuristic solution: objective 1112.0000000 Found heuristic solution: objective 1076.0000000 Optimize a model with 132 rows, 749 columns and 2031 nonzeros Presolved: 132 rows, 749 columns, 2031 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.091e+03 Factor NZ : 2.986e+03 Factor Ops : 7.554e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.06427378e+03 -7.09654227e+04 8.40e+04 2.22e-16 3.78e+02 0s 1 2.13456935e+03 -3.44895999e+04 1.08e+04 9.99e-16 6.30e+01 0s 2 1.02629510e+03 -8.38509019e+03 2.17e+03 3.55e-15 1.31e+01 0s 3 5.61442446e+02 -1.79619260e+03 7.55e+01 1.67e-15 1.72e+00 0s 4 4.67872023e+02 -5.27463115e+02 5.31e+01 1.10e-15 7.22e-01 0s 5 4.35889842e+02 -3.97180832e+02 4.60e+01 1.08e-15 6.01e-01 0s 6 3.12890526e+02 -1.10367693e+02 2.46e+01 9.16e-16 2.99e-01 0s 7 2.08167388e+02 1.98208878e+01 8.55e+00 8.79e-16 1.30e-01 0s 8 1.75308741e+02 1.16657189e+02 3.86e+00 5.89e-16 4.08e-02 0s 9 1.68585838e+02 1.39416394e+02 2.27e+00 9.99e-16 2.02e-02 0s 10 1.62304102e+02 1.57916712e+02 2.79e-01 8.22e-16 2.96e-03 0s 11 1.60159631e+02 1.60097465e+02 1.28e-12 1.04e-15 4.11e-05 0s 12 1.60142874e+02 1.60142812e+02 8.15e-13 7.89e-16 4.11e-08 0s 13 1.60142857e+02 1.60142857e+02 6.26e-13 1.11e-15 5.05e-14 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.60142857e+02 Root relaxation: objective 1.601429e+02, 453 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 160.14286 0 23 1076.00000 160.14286 85.1% - 0s H 0 0 161.0000000 160.14286 0.53% - 0s Explored 0 nodes (617 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.610000000000e+02, best bound 1.610000000000e+02, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.04 seconds Total run time: 0.11 seconds Objective: 161 Solution: 1 x [1, 2, 3, 5, 10, 10, 10] 3 x [1, 2, 3, 3, 5, 10, 10] 2 x [4, 7, 8, 8, 8, 8, 8] 5 x [4, 4, 7, 8, 8, 8, 8] 19 x [3, 3, 3, 8, 10, 10, 15] 1 x [7, 8, 8, 8] 18 x [3, 3, 3, 3, 6, 6, 10] 8 x [3, 3, 3, 10, 10, 12, 13] 1 x [3, 3, 10, 10, 10, 13] 1 x [3, 3, 3, 10, 13] 16 x [3, 3, 3, 9, 10, 10, 14] 38 x [2, 3, 3, 3, 10, 10, 10] 4 x [3, 3, 3, 3, 10, 10, 11] 8 x [3, 3, 3, 3, 9, 10, 10] 36 x [3, 3, 3, 3, 3, 10, 10]