Build (method = -2) #dp: 9460 Step-3' Graph: 559 vertices and 2293 arcs (0.05s) Step-4' Graph: 472 vertices and 2119 arcs (0.05s) #V4/#V3 = 0.84 #A4/#A3 = 0.92 Ready! (0.05s) Optimize a model with 482 rows, 2120 columns and 5429 nonzeros Presolve removed 114 rows and 212 columns Presolve time: 0.03s Presolved: 368 rows, 1908 columns, 5133 nonzeros Variable types: 0 continuous, 1908 integer (0 binary) Found heuristic solution: objective 100.0000000 Optimize a model with 368 rows, 1908 columns and 5133 nonzeros Presolved: 368 rows, 1908 columns, 5133 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.830e+03 Factor NZ : 1.103e+04 (roughly 1 MByte of memory) Factor Ops : 4.210e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.57383084e+02 -3.69210658e+04 3.18e+04 2.22e-16 6.52e+01 0s 1 3.14272224e+02 -1.87412439e+04 6.20e+03 7.77e-16 1.41e+01 0s 2 1.84396967e+02 -7.79060313e+03 1.82e+03 7.77e-16 4.28e+00 0s 3 1.18763567e+02 -2.19101316e+03 4.00e+02 1.15e-14 1.01e+00 0s 4 1.00467157e+02 -4.17937016e+02 1.45e+01 1.38e-14 1.46e-01 0s 5 9.93510474e+01 -1.36481867e+02 1.00e-01 5.55e-15 6.17e-02 0s 6 5.82368423e+01 -1.63154855e+02 4.73e-04 5.33e-15 5.79e-02 0s 7 4.84602063e+01 -6.83939680e+01 3.46e-04 2.44e-15 3.05e-02 0s 8 2.65290445e+01 -2.08789522e+01 1.70e-04 5.55e-16 1.24e-02 0s 9 1.65294887e+01 -5.41275002e+00 9.48e-05 5.03e-16 5.74e-03 0s 10 1.32464939e+01 2.52848364e-01 5.32e-05 5.22e-16 3.40e-03 0s 11 1.25149287e+01 4.51435489e+00 3.55e-05 6.23e-16 2.09e-03 0s 12 1.08802270e+01 7.67576391e+00 9.38e-06 5.66e-16 8.38e-04 0s 13 1.03459746e+01 9.31536381e+00 3.66e-06 5.34e-16 2.69e-04 0s 14 1.00345772e+01 9.73631512e+00 2.91e-07 6.44e-16 7.80e-05 0s 15 1.00017624e+01 9.99668501e+00 4.66e-10 4.47e-16 1.33e-06 0s 16 1.00000018e+01 9.99999670e+00 2.07e-12 4.26e-16 1.33e-09 0s 17 1.00000000e+01 1.00000000e+01 4.16e-12 4.78e-16 3.46e-15 0s Barrier solved model in 17 iterations and 0.03 seconds Optimal objective 1.00000000e+01 Root relaxation: objective 1.000000e+01, 1031 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 10.00000 0 38 100.00000 10.00000 90.0% - 0s H 0 0 11.0000000 10.00000 9.09% - 0s 0 0 10.00000 0 52 11.00000 10.00000 9.09% - 0s 0 0 10.00000 0 32 11.00000 10.00000 9.09% - 0s 0 0 10.00000 0 48 11.00000 10.00000 9.09% - 0s H 0 0 10.0000000 10.00000 0.0% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (4984 simplex iterations) in 0.55 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.000000000000e+01, best bound 1.000000000000e+01, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.55 seconds Total run time: 0.62 seconds Objective: 10 Solution: 3 x [1, 3, 4, 5, 6, 8, 9, 9, 9, 10] 1 x [2, 3, 4, 5, 8, 10, 10, 10, 10, 10] 1 x [2, 4, 5, 5, 7, 7, 10, 10, 10, 10] 2 x [4, 4, 5, 5, 5, 5, 6, 6, 9, 10] 1 x [1, 2, 4, 5, 5, 5, 5, 6, 6, 10] 1 x [3, 7, 7, 7, 7, 7, 7, 7, 7, 7] 1 x [1, 1, 3, 3, 4, 6, 7, 7, 7, 10]