Build (method = -2) #dp: 26781 Step-3' Graph: 1176 vertices and 5048 arcs (0.17s) Step-4' Graph: 1076 vertices and 4848 arcs (0.18s) #V4/#V3 = 0.91 #A4/#A3 = 0.96 Ready! (0.18s) Optimize a model with 1086 rows, 4849 columns and 12411 nonzeros Presolve removed 335 rows and 632 columns Presolve time: 0.07s Presolved: 751 rows, 4217 columns, 11620 nonzeros Variable types: 0 continuous, 4217 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 751 rows, 4217 columns and 11620 nonzeros Presolved: 751 rows, 4217 columns, 11620 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 6.457e+03 Factor NZ : 4.077e+04 (roughly 2 MBytes of memory) Factor Ops : 3.570e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.24953007e+04 -8.90263599e+05 9.42e+05 2.22e-16 9.93e+02 0s 1 3.45392059e+03 -5.99148548e+05 1.64e+05 1.22e-15 2.12e+02 0s 2 2.01422440e+03 -2.67938876e+05 5.13e+04 1.78e-15 6.87e+01 0s 3 1.29644822e+03 -8.41556313e+04 1.45e+04 2.66e-15 1.98e+01 0s 4 1.03871345e+03 -2.23414233e+04 2.03e+03 9.33e-15 3.98e+00 0s 5 1.00475521e+03 -9.16268323e+03 4.29e+02 2.22e-15 1.40e+00 0s 6 9.94578914e+02 -1.69322649e+03 6.89e+01 1.54e-15 3.33e-01 0s 7 7.48807970e+02 -1.08501634e+03 8.35e-11 1.69e-15 2.17e-01 0s 8 4.46611286e+02 -5.20380673e+02 4.67e-11 1.34e-15 1.15e-01 0s 9 2.05812942e+02 -1.92605293e+02 1.92e-11 1.10e-15 4.72e-02 0s 10 1.89939150e+02 -1.69637082e+02 1.61e-11 1.47e-15 4.26e-02 0s 11 1.40153465e+02 -7.53747127e+01 1.09e-11 1.37e-15 2.55e-02 0s 12 1.02589473e+02 -2.91106758e+01 3.11e-12 1.36e-15 1.56e-02 0s 13 1.00781300e+02 1.56307385e+01 3.57e-12 1.26e-15 1.01e-02 0s 14 8.76902483e+01 3.89935234e+01 5.16e-12 1.40e-15 5.77e-03 0s 15 8.34097533e+01 5.90921953e+01 3.73e-12 1.21e-15 2.88e-03 0s 16 8.09306696e+01 6.52792302e+01 5.68e-12 1.46e-15 1.85e-03 0s 17 8.05263925e+01 6.75092464e+01 5.98e-12 1.55e-15 1.54e-03 0s 18 7.78266090e+01 7.27127153e+01 2.62e-11 1.23e-15 6.06e-04 0s 19 7.70925016e+01 7.57997371e+01 4.28e-11 1.01e-15 1.53e-04 0s 20 7.69246995e+01 7.68985162e+01 2.14e-09 8.66e-16 3.10e-06 0s 21 7.69230786e+01 7.69230524e+01 9.53e-11 9.99e-16 3.10e-09 0s 22 7.69230769e+01 7.69230769e+01 2.12e-10 8.65e-16 3.10e-12 0s Barrier solved model in 22 iterations and 0.13 seconds Optimal objective 7.69230769e+01 Root relaxation: objective 7.692308e+01, 2456 iterations, 0.16 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 76.92308 0 46 1000.00000 76.92308 92.3% - 0s H 0 0 78.0000000 76.92308 1.38% - 0s H 0 0 77.0000000 76.92308 0.10% - 0s Explored 0 nodes (5304 simplex iterations) in 0.70 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.700000000000e+01, best bound 7.700000000000e+01, gap 0.0% Preprocessing time: 0.20 seconds Gurobi run time: 0.70 seconds Total run time: 0.90 seconds Objective: 77 Solution: 1 x [1, 2, 2, 3, 3, 3, 3, 3, 5, 6, 7, 8, 8] 1 x [1, 2, 3, 3, 5, 5, 7, 7, 8, 8, 8, 8] 3 x [1, 2, 2, 2, 2, 2, 5, 5, 8, 8, 8, 8, 8] 1 x [1, 2, 3, 5, 5, 5, 5, 6, 7, 10, 10, 10, 10] 14 x [1, 5, 5, 5, 5, 10, 10, 10, 10, 10, 10, 10, 10] 2 x [1, 2, 2, 2, 2, 3, 5, 5, 5, 5, 5, 10, 10] 7 x [1, 2, 3, 3, 3, 3, 3, 6, 7, 8, 8, 8, 10] 19 x [1, 3, 3, 3, 3, 3, 7, 7, 7, 8, 8, 8, 10] 1 x [1, 1, 2, 5, 5, 5, 6, 7, 8, 9, 10, 10, 10] 16 x [1, 1, 1, 2, 2, 2, 3, 4, 6, 7, 7, 7, 7] 12 x [1, 1, 1, 2, 3, 6, 7, 7, 7, 7, 8, 9, 10]