Build (method = -2) #dp: 163 Step-3' Graph: 34 vertices and 110 arcs (0.00s) Step-4' Graph: 20 vertices and 82 arcs (0.00s) #V4/#V3 = 0.59 #A4/#A3 = 0.75 Ready! (0.00s) Optimize a model with 30 rows, 83 columns and 218 nonzeros Presolve removed 6 rows and 8 columns Presolve time: 0.00s Presolved: 24 rows, 75 columns, 200 nonzeros Variable types: 0 continuous, 75 integer (0 binary) Found heuristic solution: objective 836.0000000 Optimize a model with 24 rows, 75 columns and 200 nonzeros Presolved: 24 rows, 75 columns, 200 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.100e+02 Factor NZ : 3.000e+02 Factor Ops : 4.900e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.65263907e+03 -6.96222871e+03 3.86e+03 2.22e-16 1.92e+02 0s 1 1.07503584e+03 -2.44391940e+03 4.14e+02 4.44e-16 3.18e+01 0s 2 5.86028713e+02 -4.41987076e+02 1.32e+00 2.22e-16 6.56e+00 0s 3 4.19912732e+02 2.12697084e+02 1.24e-01 1.73e-16 1.32e+00 0s 4 3.77014753e+02 3.33478281e+02 1.53e-02 1.11e-16 2.77e-01 0s 5 3.71298670e+02 3.58324972e+02 5.74e-03 2.22e-16 8.26e-02 0s 6 3.69276566e+02 3.63607762e+02 2.76e-03 1.20e-16 3.61e-02 0s 7 3.67475465e+02 3.65798276e+02 5.99e-04 2.22e-16 1.07e-02 0s 8 3.66878087e+02 3.66734906e+02 3.32e-05 2.22e-16 9.12e-04 0s 9 3.66821497e+02 3.66816611e+02 2.16e-06 1.92e-16 3.11e-05 0s 10 3.66818185e+02 3.66818180e+02 2.25e-11 1.11e-16 3.58e-08 0s 11 3.66818182e+02 3.66818182e+02 1.56e-11 3.33e-16 3.58e-11 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 3.66818182e+02 Root relaxation: objective 3.668182e+02, 10 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 366.81818 0 15 836.00000 366.81818 56.1% - 0s H 0 0 368.0000000 366.81818 0.32% - 0s 0 0 366.83333 0 18 368.00000 366.83333 0.32% - 0s H 0 0 367.0000000 366.83333 0.05% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (13 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.670000000000e+02, best bound 3.670000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 367 Solution: 41 x [4, 7] 123 x [9, 10] 41 x [5, 9] 33 x [1, 3, 8] 45 x [1, 4, 6] 1 x [6, 6, 8] 31 x [1, 2, 8, 8, 8] 10 x [1, 1, 5] 1 x [1, 1, 8] 34 x [2, 4, 4, 5] 6 x [4, 5, 5, 8] 1 x [4, 4, 4, 8, 8]