Build (method = -2) #dp: 3997 Step-3' Graph: 354 vertices and 1548 arcs (0.02s) Step-4' Graph: 289 vertices and 1418 arcs (0.02s) #V4/#V3 = 0.82 #A4/#A3 = 0.92 Ready! (0.02s) Optimize a model with 299 rows, 1419 columns and 3692 nonzeros Presolve removed 56 rows and 98 columns Presolve time: 0.02s Presolved: 243 rows, 1321 columns, 3592 nonzeros Variable types: 0 continuous, 1321 integer (0 binary) Found heuristic solution: objective 998.0000000 Optimize a model with 243 rows, 1321 columns and 3592 nonzeros Presolved: 243 rows, 1321 columns, 3592 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.022e+03 Factor NZ : 8.370e+03 Factor Ops : 4.297e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.31891302e+03 -2.31957166e+05 2.42e+05 2.22e-16 8.13e+02 0s 1 2.47382864e+03 -1.38788402e+05 3.26e+04 9.99e-16 1.40e+02 0s 2 1.59254143e+03 -5.81917730e+04 9.88e+03 3.55e-15 4.46e+01 0s 3 1.14690140e+03 -1.53203371e+04 2.43e+03 7.99e-15 1.05e+01 0s 4 1.01388253e+03 -3.47833981e+03 3.14e+02 3.55e-15 2.07e+00 0s 5 9.80618143e+02 -1.42063804e+03 4.20e-01 2.44e-15 9.06e-01 0s 6 7.37238147e+02 -1.54294788e+03 2.79e-01 2.55e-15 8.60e-01 0s 7 8.65652540e+02 -9.28428825e+02 2.18e-01 1.78e-15 6.77e-01 0s 8 5.62320867e+02 -4.32635335e+02 1.20e-01 6.91e-16 3.75e-01 0s 9 3.85734935e+02 -2.75602437e+02 7.32e-02 6.83e-16 2.50e-01 0s 10 2.57465417e+02 -8.60786943e+01 4.42e-02 5.90e-16 1.30e-01 0s 11 2.01516294e+02 -4.14220445e+01 3.10e-02 6.83e-16 9.17e-02 0s 12 1.87089225e+02 -9.19127969e+00 2.78e-02 6.06e-16 7.41e-02 0s 13 1.70618074e+02 5.05092269e+00 2.38e-02 7.67e-16 6.25e-02 0s 14 1.47487270e+02 2.62090636e+01 1.82e-02 7.56e-16 4.58e-02 0s 15 1.36468234e+02 4.98745839e+01 1.34e-02 6.56e-16 3.27e-02 0s 16 1.21161891e+02 8.88318144e+01 5.63e-03 5.03e-16 1.22e-02 0s 17 1.12773590e+02 9.94199170e+01 2.04e-03 5.70e-16 5.04e-03 0s 18 1.09849582e+02 1.02362755e+02 1.03e-03 5.60e-16 2.82e-03 0s 19 1.07877022e+02 1.04349994e+02 3.94e-04 5.45e-16 1.33e-03 0s 20 1.07316613e+02 1.04767541e+02 2.50e-04 6.92e-16 9.62e-04 0s 21 1.06965198e+02 1.04935599e+02 1.67e-04 7.27e-16 7.66e-04 0s 22 1.06460021e+02 1.05704462e+02 5.60e-05 5.02e-16 2.85e-04 0s 23 1.06256457e+02 1.05945150e+02 2.29e-05 5.02e-16 1.17e-04 0s 24 1.06175091e+02 1.06038445e+02 8.56e-06 5.15e-16 5.15e-05 0s 25 1.06128619e+02 1.06068525e+02 2.26e-06 5.68e-16 2.27e-05 0s 26 1.06116218e+02 1.06101092e+02 3.81e-07 4.31e-16 5.71e-06 0s 27 1.06112193e+02 1.06110086e+02 6.44e-09 5.45e-16 7.95e-07 0s 28 1.06112004e+02 1.06111981e+02 1.32e-11 4.00e-16 8.66e-09 0s 29 1.06112000e+02 1.06112000e+02 8.88e-13 4.81e-16 9.41e-15 0s Barrier solved model in 29 iterations and 0.03 seconds Optimal objective 1.06112000e+02 Root relaxation: objective 1.061120e+02, 286 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 106.11200 0 38 998.00000 106.11200 89.4% - 0s H 0 0 107.0000000 106.11200 0.83% - 0s Explored 0 nodes (459 simplex iterations) in 0.09 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.070000000000e+02, best bound 1.070000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.09 seconds Total run time: 0.12 seconds Objective: 107 Solution: 1 x [1, 1, 1, 2, 3, 4, 9] 4 x [3, 3, 3, 4, 5, 6, 8] 1 x [3, 3, 3, 4, 5, 6] 22 x [4, 4, 4, 6, 7, 7, 8, 9, 9, 10] 14 x [5, 5, 6, 8, 8, 8, 10, 10, 10, 10] 9 x [4, 4, 4, 4, 4, 4, 6, 8, 8, 8] 1 x [6, 6, 10, 10, 10] 8 x [1, 1, 3, 5, 5, 9, 9, 9, 9] 1 x [3, 4, 5, 5, 7, 7, 10] 11 x [3, 4, 4, 4, 4, 5, 5, 7, 7, 10] 2 x [3, 4, 5, 5, 7, 7, 7, 7, 10] 33 x [3, 3, 4, 4, 7, 7, 7, 9, 10]