Build (method = -2) #dp: 3659 Step-3' Graph: 343 vertices and 1414 arcs (0.02s) Step-4' Graph: 264 vertices and 1256 arcs (0.02s) #V4/#V3 = 0.77 #A4/#A3 = 0.89 Ready! (0.02s) Optimize a model with 274 rows, 1257 columns and 3255 nonzeros Presolve removed 58 rows and 100 columns Presolve time: 0.01s Presolved: 216 rows, 1157 columns, 3149 nonzeros Variable types: 0 continuous, 1157 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 216 rows, 1157 columns and 3149 nonzeros Presolved: 216 rows, 1157 columns, 3149 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.734e+03 Factor NZ : 6.150e+03 Factor Ops : 2.227e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.49878177e+03 -1.98125636e+05 1.42e+05 1.11e-16 5.59e+02 0s 1 2.17664271e+03 -1.05554289e+05 2.43e+04 1.11e-15 1.17e+02 0s 2 1.44375806e+03 -4.07250065e+04 6.96e+03 2.66e-15 3.48e+01 0s 3 1.05902947e+03 -9.34130010e+03 1.02e+03 2.66e-15 6.36e+00 0s 4 9.89115399e+02 -1.98164423e+03 5.73e+01 2.89e-15 1.33e+00 0s 5 7.43065533e+02 -1.81797755e+03 1.37e+01 2.66e-15 1.12e+00 0s 6 5.95255013e+02 -9.15279249e+02 6.38e+00 2.00e-15 6.55e-01 0s 7 3.68575582e+02 -4.30939561e+02 3.37e+00 1.19e-15 3.46e-01 0s 8 2.75015285e+02 -2.65048615e+02 2.34e+00 1.33e-15 2.34e-01 0s 9 1.69170054e+02 -6.76967585e+01 1.08e+00 9.59e-16 1.03e-01 0s 10 1.38159502e+02 3.81695204e+01 5.97e-01 8.52e-16 4.33e-02 0s 11 1.28738647e+02 7.76795820e+01 3.39e-01 1.03e-15 2.21e-02 0s 12 1.22524189e+02 9.60438239e+01 2.21e-01 1.04e-15 1.15e-02 0s 13 1.14852101e+02 1.06757827e+02 7.08e-02 9.21e-16 3.50e-03 0s 14 1.11748344e+02 1.10287744e+02 1.36e-02 7.86e-16 6.32e-04 0s 15 1.11112365e+02 1.11104358e+02 1.32e-11 8.11e-16 3.45e-06 0s 16 1.11111112e+02 1.11111104e+02 1.59e-11 8.23e-16 3.45e-09 0s 17 1.11111111e+02 1.11111111e+02 1.52e-11 1.19e-15 3.45e-12 0s Barrier solved model in 17 iterations and 0.02 seconds Optimal objective 1.11111111e+02 Root relaxation: objective 1.111111e+02, 569 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 111.11111 0 31 1000.00000 111.11111 88.9% - 0s H 0 0 112.0000000 111.11111 0.79% - 0s Explored 0 nodes (960 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.120000000000e+02, best bound 1.120000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.07 seconds Total run time: 0.10 seconds Objective: 112 Solution: 1 x [2, 3, 9, 9, 9, 9, 9] 33 x [3, 4, 4, 5, 6, 7, 7, 10, 10] 17 x [4, 6, 8, 8, 8, 8, 9, 9, 9] 1 x [4, 4, 6, 6, 9, 9] 24 x [3, 4, 4, 4, 5, 7, 7, 10, 10] 13 x [3, 3, 4, 4, 4, 4, 5, 7, 9] 6 x [3, 3, 4, 4, 5, 7, 7, 10, 10] 1 x [3, 3, 4, 4, 5, 10, 10] 3 x [3, 3, 4, 9, 9, 9, 9, 9, 9] 1 x [1, 1, 1, 1, 4, 9, 9, 9] 3 x [1, 1, 1, 1, 1, 4, 9, 9, 9] 9 x [4, 7, 7, 7, 7, 8, 8, 8, 9]