Build (method = -2) #dp: 696 Step-3' Graph: 52 vertices and 145 arcs (0.00s) Step-4' Graph: 7 vertices and 55 arcs (0.00s) #V4/#V3 = 0.13 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 17 rows, 56 columns and 162 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 15 rows, 54 columns, 158 nonzeros Variable types: 0 continuous, 54 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 825.0000000 Optimize a model with 15 rows, 54 columns and 158 nonzeros Presolved: 15 rows, 54 columns, 158 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.700e+01 Factor NZ : 1.200e+02 Factor Ops : 1.240e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.12048686e+03 -6.04344176e+03 8.13e+02 2.22e-16 2.26e+02 0s 1 6.72553263e+02 -2.55970806e+03 5.41e+00 5.55e-16 2.89e+01 0s 2 4.50301854e+02 -4.71246092e+02 5.00e-01 2.78e-16 7.96e+00 0s 3 2.41339033e+02 7.71412814e+01 3.40e-04 1.11e-16 1.39e+00 0s 4 2.02637242e+02 1.91659689e+02 2.31e-05 2.22e-16 9.30e-02 0s 5 2.00014096e+02 1.99972966e+02 7.88e-14 2.22e-16 3.49e-04 0s 6 2.00000000e+02 2.00000000e+02 9.32e-14 1.11e-16 3.88e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+02 Root relaxation: objective 2.000000e+02, 45 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 200.0000000 200.00000 0.0% - 0s Explored 0 nodes (45 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+02, best bound 2.000000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 200 Solution: 39 x [5, 7, 8, 8, 10] 4 x [1, 5, 6, 7, 10] 56 x [4, 7, 8, 9, 10] 72 x [2, 4, 6, 7, 10] 4 x [3, 6, 7, 8, 10] 1 x [2, 6, 7, 8, 9] 3 x [1, 2, 6, 7, 8] 21 x [1, 3, 6, 7, 7]