Build (method = -2) #dp: 6827 Step-3' Graph: 256 vertices and 929 arcs (0.03s) Step-4' Graph: 187 vertices and 791 arcs (0.03s) #V4/#V3 = 0.73 #A4/#A3 = 0.85 Ready! (0.03s) Optimize a model with 197 rows, 792 columns and 2010 nonzeros Presolve removed 57 rows and 112 columns Presolve time: 0.01s Presolved: 140 rows, 680 columns, 1823 nonzeros Variable types: 0 continuous, 680 integer (0 binary) Found heuristic solution: objective 94.0000000 Found heuristic solution: objective 83.0000000 Optimize a model with 140 rows, 680 columns and 1823 nonzeros Presolved: 140 rows, 680 columns, 1823 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.038e+03 Factor NZ : 3.424e+03 Factor Ops : 1.009e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.14356200e+02 -1.95652498e+04 1.05e+04 2.22e-16 7.61e+01 0s 1 3.14973999e+02 -7.79201177e+03 2.07e+03 1.89e-15 1.61e+01 0s 2 1.66846041e+02 -2.57735168e+03 4.16e+02 1.33e-15 3.55e+00 0s 3 1.29992148e+02 -5.82415739e+02 2.24e+01 3.11e-15 5.73e-01 0s 4 9.69736079e+01 -2.30964820e+02 7.38e+00 1.89e-15 2.50e-01 0s 5 9.38316059e+01 -1.67973307e+02 6.43e+00 1.78e-15 1.98e-01 0s 6 7.49033429e+01 -1.70802971e+02 3.46e+00 2.36e-15 1.84e-01 0s 7 5.83216599e+01 -8.67008360e+01 1.62e+00 1.55e-15 1.07e-01 0s 8 4.18373157e+01 -2.32802137e+01 9.47e-01 1.25e-15 4.83e-02 0s 9 2.37476869e+01 -1.53149403e+01 4.88e-01 1.33e-15 2.89e-02 0s 10 1.80459987e+01 -1.46528181e+00 3.12e-01 8.11e-16 1.45e-02 0s 11 1.29251589e+01 4.21079086e+00 1.42e-01 9.27e-16 6.45e-03 0s 12 1.24756806e+01 9.36988421e+00 7.43e-02 1.08e-15 2.29e-03 0s 13 1.13385608e+01 1.07538780e+01 1.26e-02 9.48e-16 4.30e-04 0s 14 1.11138039e+01 1.11063898e+01 1.34e-04 9.62e-16 5.45e-06 0s 15 1.11111111e+01 1.11111111e+01 2.83e-10 7.73e-16 1.59e-11 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 1.11111111e+01 Root relaxation: objective 1.111111e+01, 365 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.11111 0 33 83.00000 11.11111 86.6% - 0s H 0 0 17.0000000 11.11111 34.6% - 0s 0 0 11.11111 0 51 17.00000 11.11111 34.6% - 0s H 0 0 13.0000000 11.11111 14.5% - 0s H 0 0 12.0000000 11.11111 7.41% - 0s Cutting planes: Gomory: 1 MIR: 1 Zero half: 1 Explored 0 nodes (609 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+01, best bound 1.200000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.07 seconds Total run time: 0.11 seconds Objective: 12 Solution: 2 x [1, 1, 1, 2, 2, 4, 9, 10, 10] 1 x [4, 4, 4, 5, 5, 5, 6, 9, 10] 2 x [2, 2, 3, 4, 5, 5, 5, 9, 9] 1 x [1, 1, 1, 3, 3, 3, 3, 4, 10] 1 x [2, 2, 2, 3, 4, 7] 1 x [3, 3, 3, 4, 4, 4] 1 x [3, 5, 7, 7, 7, 10, 10, 10] 1 x [6, 6, 6, 7, 10, 10, 10, 10] 2 x [2, 2, 3, 5, 5, 5, 8, 8, 8]