Build (method = -2) #dp: 56 Step-3' Graph: 15 vertices and 38 arcs (0.00s) Step-4' Graph: 9 vertices and 26 arcs (0.00s) #V4/#V3 = 0.60 #A4/#A3 = 0.68 Ready! (0.00s) Optimize a model with 19 rows, 27 columns and 67 nonzeros Presolve removed 13 rows and 17 columns Presolve time: 0.00s Presolved: 6 rows, 10 columns, 24 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Found heuristic solution: objective 692.0000000 Found heuristic solution: objective 579.0000000 Optimize a model with 6 rows, 10 columns and 24 nonzeros Presolved: 6 rows, 10 columns, 24 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.100e+01 Factor NZ : 2.100e+01 Factor Ops : 9.100e+01 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.10973442e+02 3.70376567e+01 1.34e+02 2.22e-16 5.68e+01 0s 1 6.21975638e+02 4.62369158e+02 4.17e-02 2.22e-16 7.29e+00 0s 2 5.75117168e+02 5.60968311e+02 1.07e-14 2.22e-16 6.43e-01 0s 3 5.73015374e+02 5.72986983e+02 2.84e-14 2.22e-16 1.29e-03 0s 4 5.73000015e+02 5.72999987e+02 5.33e-15 1.11e-16 1.29e-06 0s 5 5.73000000e+02 5.73000000e+02 2.13e-14 9.36e-17 1.29e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.73000000e+02 Root relaxation: objective 5.730000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 573.0000000 573.00000 0.0% - 0s Explored 0 nodes (4 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.730000000000e+02, best bound 5.730000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 573 Solution: 182 x [1] 98 x [2, 9] 22 x [3, 9, 10] 33 x [4, 8] 54 x [5, 6] 119 x [5, 7] 6 x [5, 8, 9, 10] 58 x [6, 8] 1 x [6, 8, 9, 10]