Build (method = -2) #dp: 426 Step-3' Graph: 42 vertices and 116 arcs (0.00s) Step-4' Graph: 6 vertices and 44 arcs (0.00s) #V4/#V3 = 0.14 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 16 rows, 45 columns and 130 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 14 rows, 43 columns, 126 nonzeros Variable types: 0 continuous, 43 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 958.0000000 Optimize a model with 14 rows, 43 columns and 126 nonzeros Presolved: 14 rows, 43 columns, 126 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.500e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.74784063e+03 -4.36296740e+03 5.31e+02 2.22e-16 1.96e+02 0s 1 7.78251212e+02 -1.89712904e+03 2.99e+01 3.33e-16 3.29e+01 0s 2 4.03397316e+02 2.94979589e+01 2.41e-02 3.77e-15 3.92e+00 0s 3 2.58554677e+02 1.92220705e+02 7.26e-04 8.33e-16 6.91e-01 0s 4 2.50278088e+02 2.46651973e+02 2.15e-05 8.33e-17 3.78e-02 0s 5 2.50000043e+02 2.49999505e+02 1.75e-14 1.99e-16 5.61e-06 0s 6 2.50000000e+02 2.50000000e+02 3.53e-14 2.22e-16 5.61e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.50000000e+02 Root relaxation: objective 2.500000e+02, 36 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 250.0000000 250.00000 0.0% - 0s Explored 0 nodes (36 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+02, best bound 2.500000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 250 Solution: 2 x [5, 8, 8, 10] 40 x [6, 7, 8, 10] 7 x [2, 3, 8, 9] 107 x [1, 4, 8, 9] 4 x [3, 4, 5, 8] 1 x [3, 7, 8, 8] 66 x [2, 3, 3, 6] 23 x [2, 4, 6, 7]