Build (method = -2) #dp: 433 Step-3' Graph: 42 vertices and 113 arcs (0.00s) Step-4' Graph: 9 vertices and 47 arcs (0.00s) #V4/#V3 = 0.21 #A4/#A3 = 0.42 Ready! (0.00s) Optimize a model with 15 rows, 48 columns and 136 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 13 rows, 46 columns, 132 nonzeros Variable types: 0 continuous, 46 integer (0 binary) Found heuristic solution: objective 197.0000000 Found heuristic solution: objective 193.0000000 Optimize a model with 13 rows, 46 columns and 132 nonzeros Presolved: 13 rows, 46 columns, 132 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.200e+01 Factor NZ : 9.100e+01 Factor Ops : 8.190e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.88195297e+02 -1.70139755e+03 3.98e+02 1.11e-16 7.99e+01 0s 1 1.56350184e+02 -5.99818522e+02 2.25e+01 3.33e-16 9.81e+00 0s 2 6.88862839e+01 -4.55852235e+01 3.67e-02 1.55e-15 1.17e+00 0s 3 3.46888494e+01 6.58845381e-01 4.56e-03 4.44e-16 3.47e-01 0s 4 2.95434628e+01 2.59497072e+01 5.41e-04 2.15e-16 3.67e-02 0s 5 2.82935282e+01 2.82747445e+01 3.18e-06 3.33e-16 1.92e-04 0s 6 2.82857143e+01 2.82857143e+01 3.76e-12 2.22e-16 2.09e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.82857143e+01 Root relaxation: objective 2.828571e+01, 35 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.28571 0 8 193.00000 28.28571 85.3% - 0s H 0 0 29.0000000 28.28571 2.46% - 0s Explored 0 nodes (39 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.900000000000e+01, best bound 2.900000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 29 Solution: 3 x [1, 2, 3, 3, 3, 5, 6] 1 x [2, 3, 3, 4, 5, 6, 6] 1 x [2, 3, 3, 6, 6] 6 x [1, 3, 3, 3, 3, 5, 6] 17 x [3, 3, 3, 4, 6, 6, 6] 1 x [3, 3, 3, 5]