Build (method = -2) #dp: 3936 Step-3' Graph: 450 vertices and 2121 arcs (0.02s) Step-4' Graph: 427 vertices and 2075 arcs (0.02s) #V4/#V3 = 0.95 #A4/#A3 = 0.98 Ready! (0.02s) Optimize a model with 437 rows, 2076 columns and 5388 nonzeros Presolve removed 46 rows and 87 columns Presolve time: 0.02s Presolved: 391 rows, 1989 columns, 5285 nonzeros Variable types: 0 continuous, 1989 integer (0 binary) Found heuristic solution: objective 81.0000000 Optimize a model with 391 rows, 1989 columns and 5285 nonzeros Presolved: 391 rows, 1989 columns, 5285 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.136e+03 Factor NZ : 1.723e+04 (roughly 1 MByte of memory) Factor Ops : 1.266e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.83909628e+02 -4.68860265e+04 3.76e+04 2.22e-16 1.10e+02 0s 1 2.48264316e+02 -2.77703141e+04 4.96e+03 6.66e-16 1.86e+01 0s 2 1.41795979e+02 -1.12277273e+04 1.20e+03 1.02e-14 5.05e+00 0s 3 1.05455255e+02 -2.23264782e+03 2.08e+02 1.95e-14 8.76e-01 0s 4 8.87502338e+01 -5.92384271e+02 3.81e+00 3.94e-15 1.74e-01 0s 5 8.79228945e+01 -3.29061224e+02 7.41e-02 2.73e-15 1.05e-01 0s 6 8.55683431e+01 -2.63003968e+02 2.49e-02 2.16e-15 8.74e-02 0s 7 7.26711084e+01 -2.24695907e+02 8.41e-03 2.21e-15 7.46e-02 0s 8 5.93922907e+01 -1.30313245e+02 5.46e-03 1.61e-15 4.76e-02 0s 9 4.45131070e+01 -6.20781315e+01 3.05e-03 1.26e-15 2.67e-02 0s 10 2.57707898e+01 -1.34402854e+01 1.52e-03 9.76e-16 9.83e-03 0s 11 1.98759309e+01 -4.50578158e+00 9.12e-04 1.21e-15 6.11e-03 0s 12 1.84051268e+01 -2.87988020e+00 7.43e-04 1.69e-15 5.34e-03 0s 13 1.55864920e+01 1.13591766e+00 4.97e-04 1.43e-15 3.62e-03 0s 14 1.39318342e+01 5.40863129e+00 3.55e-04 1.14e-15 2.14e-03 0s 15 1.34223696e+01 8.43007826e+00 2.42e-04 1.06e-15 1.25e-03 0s 16 1.24093969e+01 1.06371868e+01 6.56e-05 9.98e-16 4.44e-04 0s 17 1.18659411e+01 1.13504131e+01 1.13e-05 9.69e-16 1.29e-04 0s 18 1.17608878e+01 1.15477250e+01 4.28e-06 1.05e-15 5.35e-05 0s 19 1.17245970e+01 1.16036880e+01 2.32e-06 1.13e-15 3.03e-05 0s 20 1.17000961e+01 1.16289186e+01 1.15e-06 1.37e-15 1.78e-05 0s 21 1.16829342e+01 1.16524378e+01 4.06e-07 1.17e-15 7.65e-06 0s 22 1.16727202e+01 1.16660849e+01 4.88e-08 1.04e-15 1.66e-06 0s 23 1.16710447e+01 1.16708099e+01 4.67e-10 8.82e-16 5.89e-08 0s 24 1.16710000e+01 1.16710000e+01 1.03e-13 1.16e-15 4.70e-12 0s Barrier solved model in 24 iterations and 0.06 seconds Optimal objective 1.16710000e+01 Root relaxation: objective 1.167100e+01, 503 iterations, 0.07 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.67100 0 52 81.00000 11.67100 85.6% - 0s H 0 0 13.0000000 11.67100 10.2% - 0s H 0 0 12.0000000 11.67100 2.74% - 0s Explored 0 nodes (1027 simplex iterations) in 0.22 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.22 seconds Total run time: 0.26 seconds Objective: 12 Solution: 1 x [3, 3, 3, 5, 7, 8, 9, 10] 1 x [1, 1, 4, 7, 7, 8, 10] 2 x [6, 9, 10, 10, 10, 10] 1 x [1, 1, 1, 4, 5, 7, 7, 8, 9] 1 x [1, 1, 1, 1, 4, 6, 9] 1 x [2, 3, 5, 5, 7, 7, 8, 9, 9] 1 x [2, 2, 2, 2, 3, 5, 6, 7, 7, 8] 2 x [2, 3, 3, 4, 5, 5, 6, 6, 8] 1 x [2, 3, 3, 3, 3, 6, 7, 7, 8] 1 x [1, 1, 2, 4, 4, 6, 6, 7, 8, 8, 8]