AMPL Bin Packing Problem with GCG#
Description: Dantzig-Wolfe decomposition for Bin Packing Problem with GCG
Tags: GCG, bpp, amplpy, dantzig-wolfe decomposition, branch-price-and-cut, highlights
Notebook author: Jurgen Lentz <jurgenlentz26@gmail.com>
# Install dependencies
%pip install -q amplpy
# Google Colab & Kaggle integration
from amplpy import AMPL, ampl_notebook
ampl = ampl_notebook(
modules=["gcg", "gurobi", "scip", "highs", "cbc"], # modules to install
license_uuid="default", # license to use
) # instantiate AMPL object and register magics
Bin Packing Problem#
Given \(n\) items with weights \(w_{i}\) for all \(i \in \{1,...,n\}\) and bins with capacity \(C\) (for each bin), the bin packing problem assigns each item \(i\) to a bin while minimizing the number of used bins. BPP can be modeled as follows:
\[\begin{split}
\begin{aligned}
\text{minimize} \quad &\sum_{j = 1}^{m} y_{j} \\
\text{subject to} \quad &\sum_{i = 1}^{n} w_{i} x_{i j} \leq C y_{j} \quad \forall j \in \{1,...,m\} \\
&\sum_{j = 1}^{m} x_{i j} \geq 1 \quad \forall i \in \{1,...,n\} \\
&x_{i j} \in \{0,1\} \quad \forall i \in \{1,...,n\}, j \in \{1,...,m\} \\
&y_{j} \in \{0,1\} \quad \forall j \in \{1,...,m\}
\end{aligned}
\end{split}\]
We use suffix to feed GCG with a decomposition. Here, we select all allocation constraints to be in the master problem and \(m\) knapsack subproblems (GCG aggregates the subproblems).
%%ampl_eval
param n;
param C;
suffix master IN, binary;
suffix block IN, integer;
set I = 1..n ordered;
param w {I} > 0;
param maxVal := max {i in I} w[i];
param maxbins := ceil(n / floor(C / maxVal));
set J = 1..maxbins;
var x {I,J} binary;
var y {J} binary;
minimize Cost: sum {j in J} y[j];
subject to b_Capacity {j in J}:
sum {i in I} w[i] * x[i,j] <= C * y[j] suffix block j;
subject to m_Allocate {i in I}:
sum {j in J} x[i,j] >= 1 suffix master 1;
We generate a small instance with 50 items and bins with a capacity of 120.
ampl.param["n"] = 50
ampl.param["C"] = 120
w = [
100, 99, 98, 96, 94, 90, 89, 88, 88, 86,
84, 81, 81, 80, 79, 79, 78, 76, 72, 72,
72, 68, 68, 65, 63, 63, 63, 62, 62, 57,
57, 55, 48, 48, 47, 45, 44, 44, 41, 39,
36, 33, 31, 30, 28, 26, 25, 24, 22, 20,
]
ampl.param["w"] = {i: w[i - 1] for i in range(1, len(w) + 1)}
Solve with GCG#
ampl.option["solver"] = "gcg"
ampl.option["gcg_options"] = "outlev=1 tech:timing=1"
ampl.solve()
GCG 4.0.0: tech:outlev = 1
tech:timing = 1
added complete decomp for original problem with 50 blocks and 50 masterconss, 0 linkingvars, 0 mastervars, and max white score of 0.490000
presolving:
(round 1, exhaustive) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 705 clqs
(round 2, fast) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 50 upgd conss, 0 impls, 705 clqs
(round 3, exhaustive) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 100 upgd conss, 0 impls, 705 clqs
(0.1s) probing: 1000/2550 (39.2%) - 0 fixings, 0 aggregations, 9526 implications, 0 bound changes
(0.1s) probing: 1001/2550 (39.3%) - 0 fixings, 0 aggregations, 9527 implications, 0 bound changes
(0.1s) probing aborted: 1000/1000 successive useless probings
presolving (4 rounds: 4 fast, 3 medium, 3 exhaustive):
0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 50 changed coefficients
0 implications, 705 cliques
presolved problem has 2550 variables (2550 bin, 0 int, 0 impl, 0 cont) and 100 constraints
50 constraints of type <knapsack>
50 constraints of type <logicor>
transformed objective value is always integral (scale: 1)
Presolving Time: 0.05
calculated translation; number of missing constraints: 0; number of other partialdecs: 1
Preexisting decomposition found. Solution process started...
A Dantzig-Wolfe reformulation is applied to solve the original problem.
Chosen structure has 50 blocks and 50 linking constraints.
This decomposition has a maxwhite score of 0.490000.
Master problem is a set covering problem.
Matrix has 50 blocks, using 1 aggregated pricing problem.
time | node | left |SLP iter|MLP iter|LP it/n| mem |mdpt |ovars|mvars|ocons|mcons|mcuts| dualbound | primalbound | deg | gap
p 0.1s| 1 | 0 | 0 | 0 | - | 33M| 0 |2550 | 0 | 101 | 0 | 0 | 0.000000e+00 | 4.300000e+01 | -- | Inf
i 0.1s| 1 | 0 | 0 | 0 | - | 33M| 0 |2550 | 0 | 101 | 0 | 0 | 0.000000e+00 | 2.900000e+01 | -- | Inf
0.1s| 1 | 0 | 0 | 0 | - | 33M| 0 |2550 | 0 | 101 | 0 | 0 | 2.580833e+01 | 2.900000e+01 | -- | 12.37%
0.1s| 1 | 0 | 0 | 0 | - | 33M| 0 |2550 | 50 | 101 | 52 | 0 | 2.580833e+01 | 2.900000e+01 | 0.00%| 12.37%
0.1s| 1 | 0 | 0 | 0 | - | 33M| 0 |2550 | 100 | 101 | 52 | 0 | 2.580833e+01 | 2.900000e+01 | 0.00%| 12.37%
Starting reduced cost pricing...
0.1s| 1 | 0 | 30 | 30 | - | 33M| 0 |2550 | 100 | 101 | 52 | 0 | 2.900000e+01 | 2.900000e+01 | 41.18%| 0.00%
0.1s| 1 | 0 | 30 | 30 | - | 33M| 0 |2550 | 100 | 101 | 52 | 0 | 2.900000e+01 | 2.900000e+01 | -- | 0.00%
SCIP Status : problem is solved [optimal solution found]
Solving Time (sec) : 0.13
Solving Nodes : 1
Primal Bound : +2.90000000000000e+01 (2 solutions)
Dual Bound : +2.90000000000000e+01
Gap : 0.00 %
WARNING: Dual information only available for pure LPs (only continuous variables).
GCG 4.0.0: optimal solution; objective 29
689 simplex iterations
1 branching nodes
Setup time = 0.005574s
Solver time = 0.136792s
Total time = 0.142379s
suffix time OUT;
suffix time_setup OUT;
suffix time_solver OUT;
Solve with Gurobi#
ampl.option["solver"] = "gurobi"
ampl.option["gurobi_options"] = "outlev=1 tech:timing=1"
ampl.solve()
Gurobi 12.0.0: Set parameter LogToConsole to value 1
tech:outlev = 1
tech:timing = 1
Set parameter InfUnbdInfo to value 1
Gurobi Optimizer version 12.0.0 build v12.0.0rc1 (linux64 - "Ubuntu 22.04.5 LTS")
CPU model: 13th Gen Intel(R) Core(TM) i7-1370P, instruction set [SSE2|AVX|AVX2]
Thread count: 20 physical cores, 20 logical processors, using up to 20 threads
Non-default parameters:
InfUnbdInfo 1
Warning: LP warm-starts, PStart/DStart, discarded due to model modification
Optimize a model with 100 rows, 2550 columns and 5050 nonzeros
Model fingerprint: 0x9f0306c7
Variable types: 0 continuous, 2550 integer (0 binary)
Coefficient statistics:
Matrix range [1e+00, 1e+02]
Objective range [1e+00, 1e+00]
Bounds range [1e+00, 1e+00]
RHS range [1e+00, 1e+00]
Loaded user MIP start with objective 29
Presolve time: 0.01s
Presolved: 100 rows, 2550 columns, 5050 nonzeros
Variable types: 0 continuous, 2550 integer (2550 binary)
Root relaxation: objective 2.584167e+01, 228 iterations, 0.00 seconds (0.00 work units)
Nodes | Current Node | Objective Bounds | Work
Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time
0 0 25.84167 0 13 29.00000 25.84167 10.9% - 0s
0 0 25.84167 0 43 29.00000 25.84167 10.9% - 0s
0 0 infeasible 0 29.00000 29.00000 0.00% - 0s
0 0 infeasible 0 29.00000 29.00000 0.00% - 0s
Cutting planes:
Cover: 11
Clique: 2
MIR: 9
StrongCG: 8
Explored 1 nodes (2042 simplex iterations) in 0.08 seconds (0.13 work units)
Thread count was 20 (of 20 available processors)
Solution count 1: 29
Optimal solution found (tolerance 1.00e-04)
Best objective 2.900000000000e+01, best bound 2.900000000000e+01, gap 0.0000%
Gurobi 12.0.0: optimal solution; objective 29
2042 simplex iterations
1 branching node
Setup time = 0.004782s
Solver time = 0.080625s
Total time = 0.085427s
As seen above, GCG keeps up with Gurobi when solving this bin packing instance.
Solve with HiGHS#
ampl.option["solver"] = "highs"
ampl.option["highs_options"] = "outlev=1 tech:timing=1"
ampl.solve()
HiGHS 1.7.1: tech:outlev = 1
tech:timing = 1
Running HiGHS 1.7.1 (git hash: dcf3813): Copyright (c) 2024 HiGHS under MIT licence terms
Coefficient ranges:
Matrix [1e+00, 1e+02]
Cost [1e+00, 1e+00]
Bound [1e+00, 1e+00]
RHS [1e+00, 1e+00]
Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06
Solution has num max sum
Col infeasibilities 0 0 0
Integer infeasibilities 0 0 0
Row infeasibilities 0 0 0
Row residuals 0 0 0
Presolving model
100 rows, 2550 cols, 5050 nonzeros 0s
100 rows, 2550 cols, 5050 nonzeros 0s
MIP start solution is feasible, objective value is 29
Objective function is integral with scale 1
Solving MIP model with:
100 rows
2550 cols (2550 binary, 0 integer, 0 implied int., 0 continuous)
5050 nonzeros
Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work
Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time
0 0 0 0.00% 0 29 100.00% 0 0 0 0 0.0s
0 0 0 0.00% 25.8 29 11.03% 0 0 2 442 0.0s
Solving report
Status Optimal
Primal bound 29
Dual bound 29
Gap 0% (tolerance: 0.01%)
Solution status feasible
29 (objective)
0 (bound viol.)
0 (int. viol.)
0 (row viol.)
Timing 1.07 (total)
0.02 (presolve)
0.00 (postsolve)
Nodes 1
LP iterations 7386 (total)
0 (strong br.)
6944 (separation)
0 (heuristics)
HiGHS 1.7.1: optimal solution; objective 29
7386 simplex iterations
1 branching nodes
Setup time = 0.002745s
Solver time = 1.067214s
Total time = 1.069976s
Solve with SCIP#
ampl.option["solver"] = "scip"
ampl.option["scip_options"] = "outlev=1 tech:timing=1 lim:time=60"
ampl.solve()
SCIP 9.0.1: tech:outlev = 1
tech:timing = 1
lim:time = 60
presolving:
(round 1, exhaustive) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 705 clqs
(round 2, fast) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 50 upgd conss, 0 impls, 705 clqs
(round 3, exhaustive) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 100 upgd conss, 0 impls, 705 clqs
(0.1s) probing: 1000/2550 (39.2%) - 0 fixings, 0 aggregations, 9526 implications, 0 bound changes
(0.1s) probing: 1001/2550 (39.3%) - 0 fixings, 0 aggregations, 9527 implications, 0 bound changes
(0.1s) probing aborted: 1000/1000 successive useless probings
(0.1s) symmetry computation started: requiring (bin +, int +, cont +), (fixed: bin -, int -, cont -)
(0.1s) symmetry computation finished: 62 generators found (max: 1500, log10 of symmetry group size: 0.0) (symcode time: 0.00)
dynamic symmetry handling statistics:
orbitopal reduction: no components
orbital reduction: 1 components of sizes 62
lexicographic reduction: 62 permutations with support sizes 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100
handled 1 out of 1 symmetry components
presolving (4 rounds: 4 fast, 3 medium, 3 exhaustive):
0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 50 changed coefficients
0 implications, 705 cliques
presolved problem has 2550 variables (2550 bin, 0 int, 0 impl, 0 cont) and 100 constraints
50 constraints of type <knapsack>
50 constraints of type <logicor>
transformed objective value is always integral (scale: 1)
Presolving Time: 0.06
time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
p 0.1s| 1 | 0 | 108 | - | locks| 0 |2550 | 101 | 100 | 0 | 0 | 0 | 0 | 0.000000e+00 | 4.300000e+01 | Inf | unknown
i 0.1s| 1 | 0 | 146 | - | oneopt| 0 |2550 | 101 | 100 | 0 | 0 | 10 | 0 | 0.000000e+00 | 2.900000e+01 | Inf | unknown
0.1s| 1 | 0 | 770 | - | 41M | 0 |2550 | 101 | 100 | 0 | 0 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.1s| 1 | 0 | 835 | - | 44M | 0 |2550 | 101 | 131 | 31 | 1 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.1s| 1 | 0 | 909 | - | 47M | 0 |2550 | 101 | 161 | 61 | 2 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.2s| 1 | 0 | 981 | - | 48M | 0 |2550 | 101 | 191 | 91 | 3 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.2s| 1 | 0 | 1053 | - | 54M | 0 |2550 | 101 | 220 | 120 | 4 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.2s| 1 | 0 | 1140 | - | 56M | 0 |2550 | 101 | 249 | 149 | 5 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.2s| 1 | 0 | 1228 | - | 58M | 0 |2550 | 101 | 280 | 180 | 6 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.2s| 1 | 0 | 1375 | - | 60M | 0 |2550 | 101 | 310 | 210 | 7 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.3s| 1 | 0 | 1561 | - | 61M | 0 |2550 | 101 | 340 | 240 | 8 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.3s| 1 | 0 | 1653 | - | 63M | 0 |2550 | 101 | 367 | 267 | 9 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.3s| 1 | 0 | 1738 | - | 63M | 0 |2550 | 101 | 400 | 300 | 10 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.3s| 1 | 0 | 1925 | - | 64M | 0 |2550 | 101 | 432 | 332 | 11 | 10 | 0 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
0.6s| 1 | 2 | 3347 | - | 64M | 0 |2550 | 101 | 432 | 332 | 11 | 10 | 21 | 2.580833e+01 | 2.900000e+01 | 12.37%| unknown
time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
1.0s| 100 | 27 | 6229 | 44.9 | 66M | 23 |2550 | 198 | 219 | 589 | 1 | 109 | 21 | 2.597500e+01 | 2.900000e+01 | 11.65%| 67.87%
d 1.3s| 144 | 47 | 9288 | 52.5 |pscostdi| 29 |2550 | 221 | 228 | 0 | 1 | 133 | 21 | 2.597500e+01 | 2.900000e+01 | 11.65%| 67.87%
1.5s| 200 | 61 | 11847 | 50.6 | 70M | 29 |2550 | 325 | 209 |1006 | 1 | 237 | 21 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.17%
2.1s| 300 | 113 | 17618 | 53.0 | 70M | 29 |2550 | 407 | 243 |1492 | 1 | 319 | 21 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.22%
2.6s| 400 | 145 | 22441 | 51.8 | 71M | 38 |2550 | 533 | 232 |1684 | 1 | 446 | 34 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.33%
3.0s| 500 | 169 | 26265 | 49.1 | 72M | 38 |2550 | 604 | 231 |1888 | 1 | 525 | 34 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.50%
3.6s| 600 | 207 | 32730 | 51.7 | 74M | 40 |2550 | 716 | 0 |2231 | 0 | 640 | 34 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.51%
4.4s| 700 | 293 | 43582 | 59.8 | 81M | 41 |2550 | 737 | 308 |2723 | 1 | 661 | 34 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.51%
5.0s| 800 | 357 | 51209 | 61.9 | 82M | 41 |2550 | 803 | 248 |3057 | 1 | 735 | 53 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.80%
6.0s| 900 | 435 | 64084 | 69.3 | 84M | 41 |2550 | 822 | 261 |3506 | 1 | 765 | 107 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.81%
6.5s| 1000 | 477 | 71272 | 69.6 | 85M | 41 |2550 | 862 | 234 |3951 | 1 | 838 | 107 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.91%
7.3s| 1100 | 549 | 82341 | 73.3 | 87M | 41 |2550 | 878 | 253 |4324 | 1 | 880 | 107 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.92%
8.3s| 1200 | 623 | 96323 | 78.9 | 88M | 41 |2550 | 875 | 258 |4847 | 1 | 911 | 130 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.92%
9.3s| 1300 | 699 |109923 | 83.3 | 88M | 41 |2550 | 862 | 257 |5357 | 1 | 935 | 192 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.92%
9.9s| 1400 | 735 |119265 | 84.0 | 88M | 41 |2550 | 887 | 250 |5685 | 1 |1034 | 192 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.93%
time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
10.5s| 1500 | 775 |128201 | 84.3 | 89M | 41 |2550 | 892 | 247 |5928 | 1 |1150 | 192 | 2.597500e+01 | 2.900000e+01 | 11.65%| 68.94%
11.3s| 1600 | 825 |138647 | 85.6 | 90M | 41 |2550 | 899 | 259 |6287 | 1 |1234 | 205 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.19%
12.8s| 1700 | 898 |160539 | 93.4 | 94M | 41 |2550 | 926 | 0 |6916 | 0 |1310 | 288 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.19%
13.8s| 1800 | 974 |179012 | 98.5 | 95M | 41 |2550 | 947 | 283 |7496 | 1 |1376 | 288 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.19%
15.0s| 1900 | 1024 |201503 | 105.2 | 96M | 41 |2550 | 944 | 262 |8233 | 1 |1442 | 288 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.68%
16.1s| 2000 | 1108 |225998 | 112.2 | 96M | 41 |2550 | 949 | 271 |8704 | 1 |1482 | 297 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.68%
17.3s| 2100 | 1176 |248315 | 117.5 | 99M | 41 |2550 | 962 | 263 |9225 | 1 |1547 | 297 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.71%
18.6s| 2200 | 1207 |275903 | 124.7 | 99M | 41 |2550 |1019 | 0 |9824 | 0 |1670 | 297 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.76%
19.7s| 2300 | 1265 |297564 | 128.7 | 100M | 41 |2550 | 962 | 265 | 10k| 1 |1699 | 322 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.77%
20.4s| 2400 | 1325 |311048 | 128.9 | 102M | 44 |2550 | 952 | 284 | 10k| 1 |1751 | 322 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.77%
22.2s| 2500 | 1377 |332192 | 132.2 | 102M | 44 |2550 | 914 | 254 | 11k| 1 |1801 | 429 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.77%
23.4s| 2600 | 1441 |355507 | 136.1 | 107M | 44 |2550 | 883 | 276 | 12k| 1 |1836 | 429 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.78%
24.8s| 2700 | 1485 |383931 | 141.6 | 107M | 44 |2550 | 844 | 295 | 12k| 1 |1889 | 429 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.80%
25.9s| 2800 | 1567 |405994 | 144.4 | 120M | 44 |2550 | 849 | 273 | 13k| 1 |1909 | 429 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.80%
27.4s| 2900 | 1639 |433953 | 149.1 | 126M | 44 |2550 | 870 | 284 | 14k| 1 |1960 | 429 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.80%
time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
29.1s| 3000 | 1699 |454194 | 150.9 | 130M | 44 |2550 | 878 | 268 | 14k| 0 |2010 | 557 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.82%
30.3s| 3100 | 1761 |477115 | 153.4 | 132M | 44 |2550 | 887 | 293 | 15k| 1 |2086 | 557 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.82%
31.8s| 3200 | 1821 |505061 | 157.3 | 133M | 44 |2550 | 923 | 284 | 16k| 1 |2173 | 557 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.83%
33.1s| 3300 | 1877 |522436 | 157.8 | 133M | 44 |2550 | 909 | 276 | 16k| 2 |2224 | 710 | 2.597500e+01 | 2.900000e+01 | 11.65%| 69.83%
34.6s| 3400 | 1957 |547840 | 160.7 | 134M | 44 |2550 | 886 | 276 | 17k| 1 |2238 | 779 | 2.598333e+01 | 2.900000e+01 | 11.61%| 69.92%
36.4s| 3500 | 2021 |584680 | 166.6 | 134M | 44 |2550 | 936 | 299 | 18k| 1 |2318 | 803 | 2.598333e+01 | 2.900000e+01 | 11.61%| 69.92%
37.9s| 3600 | 2067 |618089 | 171.2 | 135M | 44 |2550 | 949 | 279 | 19k| 1 |2378 | 803 | 2.598333e+01 | 2.900000e+01 | 11.61%| 69.92%
38.8s| 3700 | 2121 |635447 | 171.3 | 135M | 44 |2550 | 970 | 286 | 19k| 1 |2445 | 803 | 2.598333e+01 | 2.900000e+01 | 11.61%| 69.94%
39.9s| 3800 | 2179 |659044 | 173.0 | 135M | 44 |2550 | 978 | 294 | 20k| 1 |2495 | 803 | 2.598333e+01 | 2.900000e+01 | 11.61%| 69.94%
43.4s| 3900 | 2253 |720191 | 184.3 | 135M | 46 |2550 |1009 | 270 | 21k| 1 |2579 | 868 | 2.598333e+01 | 2.900000e+01 | 11.61%| 69.95%
48.1s| 4000 | 2306 |808967 | 201.8 | 135M | 46 |2550 |1028 | 266 | 22k| 0 |2658 |1006 | 2.598333e+01 | 2.900000e+01 | 11.61%| 69.95%
51.3s| 4100 | 2360 |877864 | 213.7 | 138M | 46 |2550 |1060 | 298 | 23k| 1 |2756 |1011 | 2.598333e+01 | 2.900000e+01 | 11.61%| 69.95%
54.9s| 4200 | 2441 |953605 | 226.7 | 138M | 46 |2550 |1015 | 381 | 23k| 4 |2779 |1021 | 2.598333e+01 | 2.900000e+01 | 11.61%| 69.95%
58.1s| 4300 | 2507 | 1021k| 237.2 | 139M | 46 |2550 |1013 | 328 | 24k| 3 |2849 |1054 | 2.598333e+01 | 2.900000e+01 | 11.61%| 69.95%
SCIP Status : solving was interrupted [time limit reached]
Solving Time (sec) : 60.00
Solving Nodes : 4343
Primal Bound : +2.90000000000000e+01 (59 solutions)
Dual Bound : +2.59833333333333e+01
Gap : 11.61 %
No dual solution available.
SCIP 9.0.1: time limit, feasible solution; objective 29
862896 simplex iterations
4343 branching nodes
Setup time = 0.004416s
Solver time = 60.000352s
Total time = 60.004776s
absmipgap=3.01667, relmipgap=0.1161
Solve with CBC#
ampl.option["solver"] = "cbc"
ampl.option["cbc_options"] = "outlev=1 tech:timing=1 lim:time=60"
ampl.solve()
cbc 2.10.10: tech:outlev = 1
tech:timing = 1
lim:time = 60
Welcome to the CBC MILP Solver
Version: 2.10.10
Build Date: Sep 5 2023
command line - Cbc_C_Interface -log 1 -solve -quit (default strategy 1)
Continuous objective value is 25.8 - 0.01 seconds
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions
Cgl0004I processed model has 100 rows, 2550 columns (2550 integer (2550 of which binary)) and 5050 elements
Cutoff increment increased from 1e-05 to 0.9999
Cbc0045I MIPStart provided solution with cost 29
Cbc0012I Integer solution of 29 found by Reduced search after 0 iterations and 0 nodes (0.13 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 86 rows 141 columns
Cbc0031I 87 added rows had average density of 32.367816
Cbc0013I At root node, 87 cuts changed objective from 25.8 to 25.8 in 10 passes
Cbc0014I Cut generator 0 (Probing) - 534 row cuts average 9.2 elements, 0 column cuts (35 active) in 0.039 seconds - new frequency is -100
Cbc0014I Cut generator 1 (Gomory) - 281 row cuts average 413.0 elements, 0 column cuts (0 active) in 0.085 seconds - new frequency is -100
Cbc0014I Cut generator 2 (Knapsack) - 34 row cuts average 19.9 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100
Cbc0014I Cut generator 3 (Clique) - 2 row cuts average 6.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100
Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 42 row cuts average 87.0 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100
Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 6 (TwoMirCuts) - 281 row cuts average 134.9 elements, 0 column cuts (0 active) in 0.019 seconds - new frequency is -100
Cbc0014I Cut generator 7 (ZeroHalf) - 97 row cuts average 60.1 elements, 0 column cuts (0 active) in 0.014 seconds - new frequency is -100
Cbc0010I After 0 nodes, 1 on tree, 29 best solution, best possible 25.8 (0.53 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 91 rows 141 columns
Cbc0038I Full problem 100 rows 2550 columns, reduced to 92 rows 142 columns
Cbc0010I After 100 nodes, 65 on tree, 29 best solution, best possible 25.8 (0.90 seconds)
Cbc0010I After 200 nodes, 104 on tree, 29 best solution, best possible 25.8 (0.94 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 88 rows 127 columns
Cbc0010I After 300 nodes, 112 on tree, 29 best solution, best possible 25.8 (0.98 seconds)
Cbc0010I After 400 nodes, 109 on tree, 29 best solution, best possible 25.8 (1.01 seconds)
Cbc0010I After 500 nodes, 115 on tree, 29 best solution, best possible 25.8 (1.04 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 89 rows 129 columns
Cbc0010I After 600 nodes, 117 on tree, 29 best solution, best possible 25.8 (1.07 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 131 columns
Cbc0010I After 700 nodes, 117 on tree, 29 best solution, best possible 25.8 (1.11 seconds)
Cbc0010I After 800 nodes, 120 on tree, 29 best solution, best possible 25.8 (1.14 seconds)
Cbc0010I After 900 nodes, 126 on tree, 29 best solution, best possible 25.8 (1.17 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 89 rows 128 columns
Cbc0010I After 1000 nodes, 126 on tree, 29 best solution, best possible 25.8 (1.21 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 92 rows 152 columns
Cbc0010I After 1100 nodes, 224 on tree, 29 best solution, best possible 25.8 (1.40 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 93 rows 152 columns
Cbc0010I After 1200 nodes, 324 on tree, 29 best solution, best possible 25.8 (1.48 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 89 rows 145 columns
Cbc0010I After 1300 nodes, 424 on tree, 29 best solution, best possible 25.8 (1.55 seconds)
Cbc0010I After 1400 nodes, 524 on tree, 29 best solution, best possible 25.8 (1.61 seconds)
Cbc0010I After 1500 nodes, 624 on tree, 29 best solution, best possible 25.8 (1.68 seconds)
Cbc0010I After 1600 nodes, 724 on tree, 29 best solution, best possible 25.8 (1.76 seconds)
Cbc0010I After 1700 nodes, 824 on tree, 29 best solution, best possible 25.8 (1.83 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 89 rows 146 columns
Cbc0010I After 1800 nodes, 924 on tree, 29 best solution, best possible 25.8 (1.91 seconds)
Cbc0010I After 1900 nodes, 979 on tree, 29 best solution, best possible 25.8 (1.97 seconds)
Cbc0010I After 2000 nodes, 973 on tree, 29 best solution, best possible 25.8 (2.03 seconds)
Cbc0010I After 2100 nodes, 964 on tree, 29 best solution, best possible 25.8 (2.10 seconds)
Cbc0010I After 2200 nodes, 965 on tree, 29 best solution, best possible 25.8 (2.16 seconds)
Cbc0010I After 2300 nodes, 973 on tree, 29 best solution, best possible 25.8 (2.22 seconds)
Cbc0010I After 2400 nodes, 965 on tree, 29 best solution, best possible 25.8 (2.27 seconds)
Cbc0010I After 2500 nodes, 961 on tree, 29 best solution, best possible 25.8 (2.33 seconds)
Cbc0010I After 2600 nodes, 961 on tree, 29 best solution, best possible 25.8 (2.39 seconds)
Cbc0010I After 2700 nodes, 958 on tree, 29 best solution, best possible 25.8 (2.45 seconds)
Cbc0010I After 2800 nodes, 972 on tree, 29 best solution, best possible 25.8 (2.50 seconds)
Cbc0010I After 2900 nodes, 975 on tree, 29 best solution, best possible 25.8 (2.55 seconds)
Cbc0010I After 3000 nodes, 995 on tree, 29 best solution, best possible 25.8 (2.61 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 88 rows 127 columns
Cbc0010I After 3100 nodes, 994 on tree, 29 best solution, best possible 25.8 (2.66 seconds)
Cbc0010I After 3200 nodes, 987 on tree, 29 best solution, best possible 25.8 (2.72 seconds)
Cbc0010I After 3300 nodes, 975 on tree, 29 best solution, best possible 25.8 (2.78 seconds)
Cbc0010I After 3400 nodes, 981 on tree, 29 best solution, best possible 25.8 (2.83 seconds)
Cbc0010I After 3500 nodes, 988 on tree, 29 best solution, best possible 25.8 (2.88 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 88 rows 128 columns
Cbc0010I After 3600 nodes, 972 on tree, 29 best solution, best possible 25.8 (2.93 seconds)
Cbc0010I After 3700 nodes, 989 on tree, 29 best solution, best possible 25.8 (2.98 seconds)
Cbc0010I After 3800 nodes, 975 on tree, 29 best solution, best possible 25.8 (3.04 seconds)
Cbc0010I After 3900 nodes, 972 on tree, 29 best solution, best possible 25.8 (3.09 seconds)
Cbc0010I After 4000 nodes, 972 on tree, 29 best solution, best possible 25.8 (3.14 seconds)
Cbc0010I After 4100 nodes, 975 on tree, 29 best solution, best possible 25.8 (3.19 seconds)
Cbc0010I After 4200 nodes, 969 on tree, 29 best solution, best possible 25.8 (3.24 seconds)
Cbc0010I After 4300 nodes, 994 on tree, 29 best solution, best possible 25.8 (3.30 seconds)
Cbc0010I After 4400 nodes, 988 on tree, 29 best solution, best possible 25.8 (3.35 seconds)
Cbc0010I After 4500 nodes, 978 on tree, 29 best solution, best possible 25.8 (3.39 seconds)
Cbc0010I After 4600 nodes, 971 on tree, 29 best solution, best possible 25.8 (3.45 seconds)
Cbc0010I After 4700 nodes, 984 on tree, 29 best solution, best possible 25.8 (3.49 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 88 rows 127 columns
Cbc0010I After 4800 nodes, 978 on tree, 29 best solution, best possible 25.8 (3.54 seconds)
Cbc0010I After 4900 nodes, 975 on tree, 29 best solution, best possible 25.8 (3.58 seconds)
Cbc0010I After 5000 nodes, 979 on tree, 29 best solution, best possible 25.8 (3.62 seconds)
Cbc0010I After 5100 nodes, 1076 on tree, 29 best solution, best possible 25.8 (3.71 seconds)
Cbc0010I After 5200 nodes, 1176 on tree, 29 best solution, best possible 25.8 (3.78 seconds)
Cbc0010I After 5300 nodes, 1276 on tree, 29 best solution, best possible 25.8 (3.84 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 89 rows 144 columns
Cbc0010I After 5400 nodes, 1376 on tree, 29 best solution, best possible 25.8 (3.90 seconds)
Cbc0010I After 5500 nodes, 1440 on tree, 29 best solution, best possible 25.8 (3.95 seconds)
Cbc0010I After 5600 nodes, 1436 on tree, 29 best solution, best possible 25.8 (3.99 seconds)
Cbc0010I After 5700 nodes, 1453 on tree, 29 best solution, best possible 25.8 (4.03 seconds)
Cbc0010I After 5800 nodes, 1462 on tree, 29 best solution, best possible 25.8 (4.08 seconds)
Cbc0010I After 5900 nodes, 1453 on tree, 29 best solution, best possible 25.8 (4.13 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 135 columns
Cbc0010I After 6000 nodes, 1456 on tree, 29 best solution, best possible 25.8 (4.18 seconds)
Cbc0010I After 6100 nodes, 1448 on tree, 29 best solution, best possible 25.8 (4.22 seconds)
Cbc0010I After 6200 nodes, 1447 on tree, 29 best solution, best possible 25.8 (4.27 seconds)
Cbc0010I After 6300 nodes, 1454 on tree, 29 best solution, best possible 25.8 (4.31 seconds)
Cbc0010I After 6400 nodes, 1438 on tree, 29 best solution, best possible 25.8 (4.36 seconds)
Cbc0010I After 6500 nodes, 1433 on tree, 29 best solution, best possible 25.8 (4.40 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 132 columns
Cbc0010I After 6600 nodes, 1444 on tree, 29 best solution, best possible 25.8 (4.45 seconds)
Cbc0010I After 6700 nodes, 1432 on tree, 29 best solution, best possible 25.8 (4.50 seconds)
Cbc0010I After 6800 nodes, 1433 on tree, 29 best solution, best possible 25.8 (4.56 seconds)
Cbc0010I After 6900 nodes, 1431 on tree, 29 best solution, best possible 25.8 (4.59 seconds)
Cbc0010I After 7000 nodes, 1438 on tree, 29 best solution, best possible 25.8 (4.64 seconds)
Cbc0010I After 7100 nodes, 1430 on tree, 29 best solution, best possible 25.8 (4.68 seconds)
Cbc0010I After 7200 nodes, 1453 on tree, 29 best solution, best possible 25.8 (4.73 seconds)
Cbc0010I After 7300 nodes, 1440 on tree, 29 best solution, best possible 25.8 (4.77 seconds)
Cbc0010I After 7400 nodes, 1429 on tree, 29 best solution, best possible 25.8 (4.82 seconds)
Cbc0010I After 7500 nodes, 1446 on tree, 29 best solution, best possible 25.8 (4.86 seconds)
Cbc0010I After 7600 nodes, 1430 on tree, 29 best solution, best possible 25.8 (4.92 seconds)
Cbc0010I After 7700 nodes, 1434 on tree, 29 best solution, best possible 25.8 (4.97 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 138 columns
Cbc0010I After 7800 nodes, 1448 on tree, 29 best solution, best possible 25.8 (5.02 seconds)
Cbc0010I After 7900 nodes, 1444 on tree, 29 best solution, best possible 25.8 (5.08 seconds)
Cbc0010I After 8000 nodes, 1446 on tree, 29 best solution, best possible 25.8 (5.13 seconds)
Cbc0010I After 8100 nodes, 1444 on tree, 29 best solution, best possible 25.8 (5.20 seconds)
Cbc0010I After 8200 nodes, 1441 on tree, 29 best solution, best possible 25.8 (5.28 seconds)
Cbc0010I After 8300 nodes, 1438 on tree, 29 best solution, best possible 25.8 (5.33 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 135 columns
Cbc0010I After 8400 nodes, 1442 on tree, 29 best solution, best possible 25.8 (5.38 seconds)
Cbc0010I After 8500 nodes, 1432 on tree, 29 best solution, best possible 25.8 (5.44 seconds)
Cbc0010I After 8600 nodes, 1431 on tree, 29 best solution, best possible 25.8 (5.48 seconds)
Cbc0010I After 8700 nodes, 1434 on tree, 29 best solution, best possible 25.8 (5.53 seconds)
Cbc0010I After 8800 nodes, 1435 on tree, 29 best solution, best possible 25.8 (5.58 seconds)
Cbc0010I After 8900 nodes, 1431 on tree, 29 best solution, best possible 25.8 (5.63 seconds)
Cbc0010I After 9000 nodes, 1437 on tree, 29 best solution, best possible 25.8 (5.70 seconds)
Cbc0010I After 9100 nodes, 1534 on tree, 29 best solution, best possible 25.8 (5.77 seconds)
Cbc0010I After 9200 nodes, 1634 on tree, 29 best solution, best possible 25.8 (5.83 seconds)
Cbc0010I After 9300 nodes, 1710 on tree, 29 best solution, best possible 25.8 (5.88 seconds)
Cbc0010I After 9400 nodes, 1727 on tree, 29 best solution, best possible 25.8 (5.94 seconds)
Cbc0010I After 9500 nodes, 1699 on tree, 29 best solution, best possible 25.8 (6.02 seconds)
Cbc0010I After 9600 nodes, 1705 on tree, 29 best solution, best possible 25.8 (6.08 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 148 columns
Cbc0010I After 9700 nodes, 1716 on tree, 29 best solution, best possible 25.8 (6.15 seconds)
Cbc0010I After 9800 nodes, 1722 on tree, 29 best solution, best possible 25.8 (6.22 seconds)
Cbc0010I After 9900 nodes, 1693 on tree, 29 best solution, best possible 25.8 (6.30 seconds)
Cbc0010I After 10000 nodes, 1702 on tree, 29 best solution, best possible 25.8 (6.38 seconds)
Cbc0010I After 10100 nodes, 1699 on tree, 29 best solution, best possible 25.8 (6.45 seconds)
Cbc0010I After 10200 nodes, 1707 on tree, 29 best solution, best possible 25.8 (6.52 seconds)
Cbc0010I After 10300 nodes, 1694 on tree, 29 best solution, best possible 25.8 (6.61 seconds)
Cbc0010I After 10400 nodes, 1688 on tree, 29 best solution, best possible 25.8 (6.71 seconds)
Cbc0010I After 10500 nodes, 1687 on tree, 29 best solution, best possible 25.8 (6.81 seconds)
Cbc0010I After 10600 nodes, 1684 on tree, 29 best solution, best possible 25.8 (6.91 seconds)
Cbc0010I After 10700 nodes, 1705 on tree, 29 best solution, best possible 25.8 (7.05 seconds)
Cbc0010I After 10800 nodes, 1695 on tree, 29 best solution, best possible 25.8 (7.16 seconds)
Cbc0010I After 10900 nodes, 1689 on tree, 29 best solution, best possible 25.8 (7.26 seconds)
Cbc0010I After 11000 nodes, 1704 on tree, 29 best solution, best possible 25.8 (7.35 seconds)
Cbc0010I After 11100 nodes, 1755 on tree, 29 best solution, best possible 25.8 (7.52 seconds)
Cbc0010I After 11200 nodes, 1800 on tree, 29 best solution, best possible 25.8 (7.67 seconds)
Cbc0010I After 11300 nodes, 1851 on tree, 29 best solution, best possible 25.8 (7.81 seconds)
Cbc0010I After 11400 nodes, 1894 on tree, 29 best solution, best possible 25.8 (7.94 seconds)
Cbc0010I After 11500 nodes, 1940 on tree, 29 best solution, best possible 25.8 (8.07 seconds)
Cbc0010I After 11600 nodes, 1992 on tree, 29 best solution, best possible 25.8 (8.19 seconds)
Cbc0010I After 11700 nodes, 2035 on tree, 29 best solution, best possible 25.8 (8.30 seconds)
Cbc0010I After 11800 nodes, 2081 on tree, 29 best solution, best possible 25.8 (8.41 seconds)
Cbc0010I After 11900 nodes, 2133 on tree, 29 best solution, best possible 25.8 (8.51 seconds)
Cbc0010I After 12000 nodes, 2188 on tree, 29 best solution, best possible 25.8 (8.60 seconds)
Cbc0010I After 12100 nodes, 2240 on tree, 29 best solution, best possible 25.8 (8.68 seconds)
Cbc0010I After 12200 nodes, 2280 on tree, 29 best solution, best possible 25.8 (8.77 seconds)
Cbc0010I After 12300 nodes, 2328 on tree, 29 best solution, best possible 25.8 (8.86 seconds)
Cbc0010I After 12400 nodes, 2371 on tree, 29 best solution, best possible 25.8 (8.95 seconds)
Cbc0010I After 12500 nodes, 2420 on tree, 29 best solution, best possible 25.8 (9.02 seconds)
Cbc0010I After 12600 nodes, 2470 on tree, 29 best solution, best possible 25.8 (9.10 seconds)
Cbc0010I After 12700 nodes, 2517 on tree, 29 best solution, best possible 25.8 (9.17 seconds)
Cbc0010I After 12800 nodes, 2566 on tree, 29 best solution, best possible 25.8 (9.24 seconds)
Cbc0010I After 12900 nodes, 2615 on tree, 29 best solution, best possible 25.8 (9.32 seconds)
Cbc0010I After 13000 nodes, 2669 on tree, 29 best solution, best possible 25.8 (9.40 seconds)
Cbc0010I After 13100 nodes, 2736 on tree, 29 best solution, best possible 25.8 (9.49 seconds)
Cbc0010I After 13200 nodes, 2730 on tree, 29 best solution, best possible 25.8 (9.57 seconds)
Cbc0010I After 13300 nodes, 2743 on tree, 29 best solution, best possible 25.8 (9.64 seconds)
Cbc0010I After 13400 nodes, 2759 on tree, 29 best solution, best possible 25.8 (9.74 seconds)
Cbc0010I After 13500 nodes, 2775 on tree, 29 best solution, best possible 25.8 (9.82 seconds)
Cbc0010I After 13600 nodes, 2761 on tree, 29 best solution, best possible 25.8 (9.90 seconds)
Cbc0010I After 13700 nodes, 2793 on tree, 29 best solution, best possible 25.8 (9.98 seconds)
Cbc0010I After 13800 nodes, 2805 on tree, 29 best solution, best possible 25.8 (10.06 seconds)
Cbc0010I After 13900 nodes, 2791 on tree, 29 best solution, best possible 25.8 (10.14 seconds)
Cbc0010I After 14000 nodes, 2782 on tree, 29 best solution, best possible 25.8 (10.22 seconds)
Cbc0010I After 14100 nodes, 2777 on tree, 29 best solution, best possible 25.8 (10.30 seconds)
Cbc0010I After 14200 nodes, 2777 on tree, 29 best solution, best possible 25.8 (10.39 seconds)
Cbc0010I After 14300 nodes, 2779 on tree, 29 best solution, best possible 25.8 (10.46 seconds)
Cbc0010I After 14400 nodes, 2784 on tree, 29 best solution, best possible 25.8 (10.53 seconds)
Cbc0010I After 14500 nodes, 2775 on tree, 29 best solution, best possible 25.8 (10.61 seconds)
Cbc0010I After 14600 nodes, 2785 on tree, 29 best solution, best possible 25.8 (10.69 seconds)
Cbc0010I After 14700 nodes, 2780 on tree, 29 best solution, best possible 25.8 (10.77 seconds)
Cbc0010I After 14800 nodes, 2794 on tree, 29 best solution, best possible 25.8 (10.85 seconds)
Cbc0010I After 14900 nodes, 2785 on tree, 29 best solution, best possible 25.8 (10.93 seconds)
Cbc0010I After 15000 nodes, 2779 on tree, 29 best solution, best possible 25.8 (11.00 seconds)
Cbc0010I After 15100 nodes, 2805 on tree, 29 best solution, best possible 25.8 (11.09 seconds)
Cbc0010I After 15200 nodes, 2790 on tree, 29 best solution, best possible 25.8 (11.17 seconds)
Cbc0010I After 15300 nodes, 2798 on tree, 29 best solution, best possible 25.8 (11.25 seconds)
Cbc0010I After 15400 nodes, 2766 on tree, 29 best solution, best possible 25.8 (11.34 seconds)
Cbc0010I After 15500 nodes, 2806 on tree, 29 best solution, best possible 25.8 (11.41 seconds)
Cbc0010I After 15600 nodes, 2780 on tree, 29 best solution, best possible 25.8 (11.49 seconds)
Cbc0010I After 15700 nodes, 2787 on tree, 29 best solution, best possible 25.8 (11.57 seconds)
Cbc0010I After 15800 nodes, 2760 on tree, 29 best solution, best possible 25.8 (11.66 seconds)
Cbc0010I After 15900 nodes, 2763 on tree, 29 best solution, best possible 25.8 (11.74 seconds)
Cbc0010I After 16000 nodes, 2748 on tree, 29 best solution, best possible 25.8 (11.82 seconds)
Cbc0010I After 16100 nodes, 2801 on tree, 29 best solution, best possible 25.8 (11.90 seconds)
Cbc0010I After 16200 nodes, 2803 on tree, 29 best solution, best possible 25.8 (11.97 seconds)
Cbc0010I After 16300 nodes, 2780 on tree, 29 best solution, best possible 25.8 (12.05 seconds)
Cbc0010I After 16400 nodes, 2760 on tree, 29 best solution, best possible 25.8 (12.14 seconds)
Cbc0010I After 16500 nodes, 2780 on tree, 29 best solution, best possible 25.8 (12.22 seconds)
Cbc0010I After 16600 nodes, 2765 on tree, 29 best solution, best possible 25.8 (12.30 seconds)
Cbc0010I After 16700 nodes, 2759 on tree, 29 best solution, best possible 25.8 (12.39 seconds)
Cbc0010I After 16800 nodes, 2776 on tree, 29 best solution, best possible 25.8 (12.46 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 144 columns
Cbc0010I After 16900 nodes, 2763 on tree, 29 best solution, best possible 25.8 (12.55 seconds)
Cbc0010I After 17000 nodes, 2765 on tree, 29 best solution, best possible 25.8 (12.63 seconds)
Cbc0010I After 17100 nodes, 2762 on tree, 29 best solution, best possible 25.8 (12.69 seconds)
Cbc0010I After 17200 nodes, 2765 on tree, 29 best solution, best possible 25.8 (12.76 seconds)
Cbc0010I After 17300 nodes, 2761 on tree, 29 best solution, best possible 25.8 (12.82 seconds)
Cbc0010I After 17400 nodes, 2761 on tree, 29 best solution, best possible 25.8 (12.88 seconds)
Cbc0010I After 17500 nodes, 2762 on tree, 29 best solution, best possible 25.8 (12.93 seconds)
Cbc0010I After 17600 nodes, 2769 on tree, 29 best solution, best possible 25.8 (12.98 seconds)
Cbc0010I After 17700 nodes, 2756 on tree, 29 best solution, best possible 25.8 (13.02 seconds)
Cbc0010I After 17800 nodes, 2754 on tree, 29 best solution, best possible 25.8 (13.08 seconds)
Cbc0010I After 17900 nodes, 2766 on tree, 29 best solution, best possible 25.8 (13.13 seconds)
Cbc0010I After 18000 nodes, 2759 on tree, 29 best solution, best possible 25.8 (13.18 seconds)
Cbc0010I After 18100 nodes, 2763 on tree, 29 best solution, best possible 25.8 (13.23 seconds)
Cbc0010I After 18200 nodes, 2757 on tree, 29 best solution, best possible 25.8 (13.28 seconds)
Cbc0010I After 18300 nodes, 2760 on tree, 29 best solution, best possible 25.8 (13.34 seconds)
Cbc0010I After 18400 nodes, 2761 on tree, 29 best solution, best possible 25.8 (13.40 seconds)
Cbc0010I After 18500 nodes, 2763 on tree, 29 best solution, best possible 25.8 (13.45 seconds)
Cbc0010I After 18600 nodes, 2753 on tree, 29 best solution, best possible 25.8 (13.51 seconds)
Cbc0010I After 18700 nodes, 2772 on tree, 29 best solution, best possible 25.8 (13.56 seconds)
Cbc0010I After 18800 nodes, 2764 on tree, 29 best solution, best possible 25.8 (13.61 seconds)
Cbc0010I After 18900 nodes, 2767 on tree, 29 best solution, best possible 25.8 (13.66 seconds)
Cbc0010I After 19000 nodes, 2759 on tree, 29 best solution, best possible 25.8 (13.70 seconds)
Cbc0010I After 19100 nodes, 2778 on tree, 29 best solution, best possible 25.8 (13.75 seconds)
Cbc0010I After 19200 nodes, 2758 on tree, 29 best solution, best possible 25.8 (13.79 seconds)
Cbc0010I After 19300 nodes, 2767 on tree, 29 best solution, best possible 25.8 (13.84 seconds)
Cbc0010I After 19400 nodes, 2774 on tree, 29 best solution, best possible 25.8 (13.89 seconds)
Cbc0010I After 19500 nodes, 2768 on tree, 29 best solution, best possible 25.8 (13.94 seconds)
Cbc0010I After 19600 nodes, 2774 on tree, 29 best solution, best possible 25.8 (13.99 seconds)
Cbc0010I After 19700 nodes, 2773 on tree, 29 best solution, best possible 25.8 (14.03 seconds)
Cbc0010I After 19800 nodes, 2767 on tree, 29 best solution, best possible 25.8 (14.09 seconds)
Cbc0010I After 19900 nodes, 2771 on tree, 29 best solution, best possible 25.8 (14.14 seconds)
Cbc0010I After 20000 nodes, 2766 on tree, 29 best solution, best possible 25.8 (14.19 seconds)
Cbc0010I After 20100 nodes, 2761 on tree, 29 best solution, best possible 25.8 (14.25 seconds)
Cbc0010I After 20200 nodes, 2765 on tree, 29 best solution, best possible 25.8 (14.30 seconds)
Cbc0010I After 20300 nodes, 2771 on tree, 29 best solution, best possible 25.8 (14.35 seconds)
Cbc0010I After 20400 nodes, 2767 on tree, 29 best solution, best possible 25.8 (14.40 seconds)
Cbc0010I After 20500 nodes, 2762 on tree, 29 best solution, best possible 25.8 (14.45 seconds)
Cbc0010I After 20600 nodes, 2762 on tree, 29 best solution, best possible 25.8 (14.50 seconds)
Cbc0010I After 20700 nodes, 2769 on tree, 29 best solution, best possible 25.8 (14.55 seconds)
Cbc0010I After 20800 nodes, 2765 on tree, 29 best solution, best possible 25.8 (14.59 seconds)
Cbc0010I After 20900 nodes, 2765 on tree, 29 best solution, best possible 25.8 (14.64 seconds)
Cbc0010I After 21000 nodes, 2756 on tree, 29 best solution, best possible 25.8 (14.69 seconds)
Cbc0010I After 21100 nodes, 2853 on tree, 29 best solution, best possible 25.8 (14.76 seconds)
Cbc0010I After 21200 nodes, 2891 on tree, 29 best solution, best possible 25.8 (14.85 seconds)
Cbc0010I After 21300 nodes, 2876 on tree, 29 best solution, best possible 25.8 (14.95 seconds)
Cbc0010I After 21400 nodes, 2883 on tree, 29 best solution, best possible 25.8 (15.05 seconds)
Cbc0010I After 21500 nodes, 2879 on tree, 29 best solution, best possible 25.8 (15.15 seconds)
Cbc0010I After 21600 nodes, 2860 on tree, 29 best solution, best possible 25.8 (15.25 seconds)
Cbc0010I After 21700 nodes, 2857 on tree, 29 best solution, best possible 25.8 (15.36 seconds)
Cbc0010I After 21800 nodes, 2849 on tree, 29 best solution, best possible 25.8 (15.47 seconds)
Cbc0010I After 21900 nodes, 2863 on tree, 29 best solution, best possible 25.8 (15.57 seconds)
Cbc0010I After 22000 nodes, 2851 on tree, 29 best solution, best possible 25.8 (15.67 seconds)
Cbc0010I After 22100 nodes, 2853 on tree, 29 best solution, best possible 25.8 (15.77 seconds)
Cbc0010I After 22200 nodes, 2852 on tree, 29 best solution, best possible 25.8 (15.86 seconds)
Cbc0010I After 22300 nodes, 2848 on tree, 29 best solution, best possible 25.8 (15.95 seconds)
Cbc0010I After 22400 nodes, 2846 on tree, 29 best solution, best possible 25.8 (16.05 seconds)
Cbc0010I After 22500 nodes, 2846 on tree, 29 best solution, best possible 25.8 (16.14 seconds)
Cbc0010I After 22600 nodes, 2871 on tree, 29 best solution, best possible 25.8 (16.24 seconds)
Cbc0010I After 22700 nodes, 2871 on tree, 29 best solution, best possible 25.8 (16.33 seconds)
Cbc0010I After 22800 nodes, 2845 on tree, 29 best solution, best possible 25.8 (16.43 seconds)
Cbc0010I After 22900 nodes, 2852 on tree, 29 best solution, best possible 25.8 (16.52 seconds)
Cbc0010I After 23000 nodes, 2856 on tree, 29 best solution, best possible 25.8 (16.60 seconds)
Cbc0010I After 23100 nodes, 2842 on tree, 29 best solution, best possible 25.8 (16.68 seconds)
Cbc0010I After 23200 nodes, 2841 on tree, 29 best solution, best possible 25.8 (16.76 seconds)
Cbc0010I After 23300 nodes, 2844 on tree, 29 best solution, best possible 25.8 (16.87 seconds)
Cbc0010I After 23400 nodes, 2845 on tree, 29 best solution, best possible 25.8 (16.97 seconds)
Cbc0010I After 23500 nodes, 2842 on tree, 29 best solution, best possible 25.8 (17.07 seconds)
Cbc0010I After 23600 nodes, 2861 on tree, 29 best solution, best possible 25.8 (17.17 seconds)
Cbc0010I After 23700 nodes, 2851 on tree, 29 best solution, best possible 25.8 (17.28 seconds)
Cbc0010I After 23800 nodes, 2851 on tree, 29 best solution, best possible 25.8 (17.38 seconds)
Cbc0010I After 23900 nodes, 2879 on tree, 29 best solution, best possible 25.8 (17.46 seconds)
Cbc0010I After 24000 nodes, 2863 on tree, 29 best solution, best possible 25.8 (17.55 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 145 columns
Cbc0010I After 24100 nodes, 2869 on tree, 29 best solution, best possible 25.8 (17.65 seconds)
Cbc0010I After 24200 nodes, 2860 on tree, 29 best solution, best possible 25.8 (17.73 seconds)
Cbc0010I After 24300 nodes, 2851 on tree, 29 best solution, best possible 25.8 (17.82 seconds)
Cbc0010I After 24400 nodes, 2855 on tree, 29 best solution, best possible 25.8 (17.90 seconds)
Cbc0010I After 24500 nodes, 2853 on tree, 29 best solution, best possible 25.8 (17.98 seconds)
Cbc0010I After 24600 nodes, 2867 on tree, 29 best solution, best possible 25.8 (18.07 seconds)
Cbc0010I After 24700 nodes, 2863 on tree, 29 best solution, best possible 25.8 (18.17 seconds)
Cbc0010I After 24800 nodes, 2850 on tree, 29 best solution, best possible 25.8 (18.26 seconds)
Cbc0010I After 24900 nodes, 2856 on tree, 29 best solution, best possible 25.8 (18.35 seconds)
Cbc0010I After 25000 nodes, 2863 on tree, 29 best solution, best possible 25.8 (18.44 seconds)
Cbc0010I After 25100 nodes, 2937 on tree, 29 best solution, best possible 25.8 (18.53 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 148 columns
Cbc0010I After 25200 nodes, 2967 on tree, 29 best solution, best possible 25.8 (18.63 seconds)
Cbc0010I After 25300 nodes, 2962 on tree, 29 best solution, best possible 25.8 (18.75 seconds)
Cbc0010I After 25400 nodes, 2936 on tree, 29 best solution, best possible 25.8 (18.88 seconds)
Cbc0010I After 25500 nodes, 2931 on tree, 29 best solution, best possible 25.8 (19.00 seconds)
Cbc0010I After 25600 nodes, 2954 on tree, 29 best solution, best possible 25.8 (19.12 seconds)
Cbc0010I After 25700 nodes, 2949 on tree, 29 best solution, best possible 25.8 (19.24 seconds)
Cbc0010I After 25800 nodes, 2964 on tree, 29 best solution, best possible 25.8 (19.35 seconds)
Cbc0010I After 25900 nodes, 2957 on tree, 29 best solution, best possible 25.8 (19.48 seconds)
Cbc0010I After 26000 nodes, 2961 on tree, 29 best solution, best possible 25.8 (19.61 seconds)
Cbc0010I After 26100 nodes, 2967 on tree, 29 best solution, best possible 25.8 (19.73 seconds)
Cbc0010I After 26200 nodes, 2977 on tree, 29 best solution, best possible 25.8 (19.86 seconds)
Cbc0010I After 26300 nodes, 2978 on tree, 29 best solution, best possible 25.8 (19.98 seconds)
Cbc0010I After 26400 nodes, 2980 on tree, 29 best solution, best possible 25.8 (20.10 seconds)
Cbc0010I After 26500 nodes, 3039 on tree, 29 best solution, best possible 25.8 (20.19 seconds)
Cbc0010I After 26600 nodes, 3020 on tree, 29 best solution, best possible 25.8 (20.32 seconds)
Cbc0010I After 26700 nodes, 2994 on tree, 29 best solution, best possible 25.8 (20.46 seconds)
Cbc0010I After 26800 nodes, 2983 on tree, 29 best solution, best possible 25.8 (20.61 seconds)
Cbc0010I After 26900 nodes, 2996 on tree, 29 best solution, best possible 25.8 (20.74 seconds)
Cbc0010I After 27000 nodes, 2986 on tree, 29 best solution, best possible 25.8 (20.85 seconds)
Cbc0010I After 27100 nodes, 2975 on tree, 29 best solution, best possible 25.8 (20.98 seconds)
Cbc0010I After 27200 nodes, 2992 on tree, 29 best solution, best possible 25.8 (21.09 seconds)
Cbc0010I After 27300 nodes, 2990 on tree, 29 best solution, best possible 25.8 (21.20 seconds)
Cbc0010I After 27400 nodes, 2982 on tree, 29 best solution, best possible 25.8 (21.34 seconds)
Cbc0010I After 27500 nodes, 2993 on tree, 29 best solution, best possible 25.8 (21.47 seconds)
Cbc0010I After 27600 nodes, 3001 on tree, 29 best solution, best possible 25.8 (21.59 seconds)
Cbc0010I After 27700 nodes, 3001 on tree, 29 best solution, best possible 25.8 (21.69 seconds)
Cbc0010I After 27800 nodes, 2995 on tree, 29 best solution, best possible 25.8 (21.82 seconds)
Cbc0010I After 27900 nodes, 2989 on tree, 29 best solution, best possible 25.8 (21.94 seconds)
Cbc0010I After 28000 nodes, 3010 on tree, 29 best solution, best possible 25.8 (22.05 seconds)
Cbc0010I After 28100 nodes, 2988 on tree, 29 best solution, best possible 25.8 (22.17 seconds)
Cbc0010I After 28200 nodes, 2987 on tree, 29 best solution, best possible 25.8 (22.28 seconds)
Cbc0010I After 28300 nodes, 2981 on tree, 29 best solution, best possible 25.8 (22.39 seconds)
Cbc0010I After 28400 nodes, 2976 on tree, 29 best solution, best possible 25.8 (22.50 seconds)
Cbc0010I After 28500 nodes, 2972 on tree, 29 best solution, best possible 25.8 (22.61 seconds)
Cbc0010I After 28600 nodes, 3019 on tree, 29 best solution, best possible 25.8 (22.71 seconds)
Cbc0010I After 28700 nodes, 3018 on tree, 29 best solution, best possible 25.8 (22.82 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 89 rows 144 columns
Cbc0010I After 28800 nodes, 2999 on tree, 29 best solution, best possible 25.8 (22.94 seconds)
Cbc0010I After 28900 nodes, 2966 on tree, 29 best solution, best possible 25.8 (23.09 seconds)
Cbc0010I After 29000 nodes, 2974 on tree, 29 best solution, best possible 25.8 (23.22 seconds)
Cbc0010I After 29100 nodes, 3044 on tree, 29 best solution, best possible 25.8 (23.30 seconds)
Cbc0010I After 29200 nodes, 3035 on tree, 29 best solution, best possible 25.8 (23.41 seconds)
Cbc0010I After 29300 nodes, 3052 on tree, 29 best solution, best possible 25.8 (23.51 seconds)
Cbc0010I After 29400 nodes, 3062 on tree, 29 best solution, best possible 25.8 (23.60 seconds)
Cbc0010I After 29500 nodes, 3055 on tree, 29 best solution, best possible 25.8 (23.68 seconds)
Cbc0010I After 29600 nodes, 3070 on tree, 29 best solution, best possible 25.8 (23.75 seconds)
Cbc0010I After 29700 nodes, 3046 on tree, 29 best solution, best possible 25.8 (23.84 seconds)
Cbc0010I After 29800 nodes, 3049 on tree, 29 best solution, best possible 25.8 (23.94 seconds)
Cbc0010I After 29900 nodes, 3057 on tree, 29 best solution, best possible 25.8 (24.04 seconds)
Cbc0010I After 30000 nodes, 3059 on tree, 29 best solution, best possible 25.8 (24.12 seconds)
Cbc0010I After 30100 nodes, 3053 on tree, 29 best solution, best possible 25.8 (24.21 seconds)
Cbc0010I After 30200 nodes, 3040 on tree, 29 best solution, best possible 25.8 (24.31 seconds)
Cbc0010I After 30300 nodes, 3046 on tree, 29 best solution, best possible 25.8 (24.41 seconds)
Cbc0010I After 30400 nodes, 3052 on tree, 29 best solution, best possible 25.8 (24.49 seconds)
Cbc0010I After 30500 nodes, 3064 on tree, 29 best solution, best possible 25.8 (24.58 seconds)
Cbc0010I After 30600 nodes, 3062 on tree, 29 best solution, best possible 25.8 (24.67 seconds)
Cbc0010I After 30700 nodes, 3058 on tree, 29 best solution, best possible 25.8 (24.76 seconds)
Cbc0010I After 30800 nodes, 3055 on tree, 29 best solution, best possible 25.8 (24.86 seconds)
Cbc0010I After 30900 nodes, 3052 on tree, 29 best solution, best possible 25.8 (24.95 seconds)
Cbc0010I After 31000 nodes, 3046 on tree, 29 best solution, best possible 25.8 (25.05 seconds)
Cbc0010I After 31100 nodes, 3040 on tree, 29 best solution, best possible 25.8 (25.16 seconds)
Cbc0010I After 31200 nodes, 3036 on tree, 29 best solution, best possible 25.8 (25.26 seconds)
Cbc0010I After 31300 nodes, 3037 on tree, 29 best solution, best possible 25.8 (25.35 seconds)
Cbc0010I After 31400 nodes, 3032 on tree, 29 best solution, best possible 25.8 (25.44 seconds)
Cbc0010I After 31500 nodes, 3038 on tree, 29 best solution, best possible 25.8 (25.53 seconds)
Cbc0010I After 31600 nodes, 3041 on tree, 29 best solution, best possible 25.8 (25.62 seconds)
Cbc0010I After 31700 nodes, 3036 on tree, 29 best solution, best possible 25.8 (25.72 seconds)
Cbc0010I After 31800 nodes, 3048 on tree, 29 best solution, best possible 25.8 (25.81 seconds)
Cbc0010I After 31900 nodes, 3033 on tree, 29 best solution, best possible 25.8 (25.91 seconds)
Cbc0010I After 32000 nodes, 3038 on tree, 29 best solution, best possible 25.8 (26.00 seconds)
Cbc0010I After 32100 nodes, 3031 on tree, 29 best solution, best possible 25.8 (26.10 seconds)
Cbc0010I After 32200 nodes, 3028 on tree, 29 best solution, best possible 25.8 (26.19 seconds)
Cbc0010I After 32300 nodes, 3075 on tree, 29 best solution, best possible 25.8 (26.27 seconds)
Cbc0010I After 32400 nodes, 3098 on tree, 29 best solution, best possible 25.8 (26.36 seconds)
Cbc0010I After 32500 nodes, 3094 on tree, 29 best solution, best possible 25.8 (26.44 seconds)
Cbc0010I After 32600 nodes, 3097 on tree, 29 best solution, best possible 25.8 (26.54 seconds)
Cbc0010I After 32700 nodes, 3100 on tree, 29 best solution, best possible 25.8 (26.63 seconds)
Cbc0010I After 32800 nodes, 3090 on tree, 29 best solution, best possible 25.8 (26.73 seconds)
Cbc0010I After 32900 nodes, 3083 on tree, 29 best solution, best possible 25.8 (26.81 seconds)
Cbc0010I After 33000 nodes, 3079 on tree, 29 best solution, best possible 25.8 (26.96 seconds)
Cbc0010I After 33100 nodes, 3122 on tree, 29 best solution, best possible 25.8 (27.01 seconds)
Cbc0010I After 33200 nodes, 3119 on tree, 29 best solution, best possible 25.8 (27.06 seconds)
Cbc0010I After 33300 nodes, 3155 on tree, 29 best solution, best possible 25.8 (27.11 seconds)
Cbc0010I After 33400 nodes, 3147 on tree, 29 best solution, best possible 25.8 (27.16 seconds)
Cbc0010I After 33500 nodes, 3170 on tree, 29 best solution, best possible 25.8 (27.22 seconds)
Cbc0010I After 33600 nodes, 3154 on tree, 29 best solution, best possible 25.8 (27.28 seconds)
Cbc0010I After 33700 nodes, 3151 on tree, 29 best solution, best possible 25.8 (27.32 seconds)
Cbc0010I After 33800 nodes, 3148 on tree, 29 best solution, best possible 25.8 (27.38 seconds)
Cbc0010I After 33900 nodes, 3153 on tree, 29 best solution, best possible 25.8 (27.42 seconds)
Cbc0010I After 34000 nodes, 3149 on tree, 29 best solution, best possible 25.8 (27.47 seconds)
Cbc0010I After 34100 nodes, 3142 on tree, 29 best solution, best possible 25.8 (27.52 seconds)
Cbc0010I After 34200 nodes, 3160 on tree, 29 best solution, best possible 25.8 (27.57 seconds)
Cbc0010I After 34300 nodes, 3179 on tree, 29 best solution, best possible 25.8 (27.62 seconds)
Cbc0010I After 34400 nodes, 3136 on tree, 29 best solution, best possible 25.8 (27.67 seconds)
Cbc0010I After 34500 nodes, 3127 on tree, 29 best solution, best possible 25.8 (27.72 seconds)
Cbc0010I After 34600 nodes, 3155 on tree, 29 best solution, best possible 25.8 (27.77 seconds)
Cbc0010I After 34700 nodes, 3151 on tree, 29 best solution, best possible 25.8 (27.82 seconds)
Cbc0010I After 34800 nodes, 3130 on tree, 29 best solution, best possible 25.8 (27.86 seconds)
Cbc0010I After 34900 nodes, 3142 on tree, 29 best solution, best possible 25.8 (27.91 seconds)
Cbc0010I After 35000 nodes, 3127 on tree, 29 best solution, best possible 25.8 (27.97 seconds)
Cbc0010I After 35100 nodes, 3127 on tree, 29 best solution, best possible 25.8 (28.02 seconds)
Cbc0010I After 35200 nodes, 3108 on tree, 29 best solution, best possible 25.8 (28.07 seconds)
Cbc0010I After 35300 nodes, 3172 on tree, 29 best solution, best possible 25.8 (28.12 seconds)
Cbc0010I After 35400 nodes, 3158 on tree, 29 best solution, best possible 25.8 (28.17 seconds)
Cbc0010I After 35500 nodes, 3149 on tree, 29 best solution, best possible 25.8 (28.22 seconds)
Cbc0010I After 35600 nodes, 3135 on tree, 29 best solution, best possible 25.8 (28.27 seconds)
Cbc0010I After 35700 nodes, 3136 on tree, 29 best solution, best possible 25.8 (28.32 seconds)
Cbc0010I After 35800 nodes, 3121 on tree, 29 best solution, best possible 25.8 (28.37 seconds)
Cbc0010I After 35900 nodes, 3122 on tree, 29 best solution, best possible 25.8 (28.42 seconds)
Cbc0010I After 36000 nodes, 3157 on tree, 29 best solution, best possible 25.8 (28.47 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 145 columns
Cbc0010I After 36100 nodes, 3133 on tree, 29 best solution, best possible 25.8 (28.52 seconds)
Cbc0010I After 36200 nodes, 3141 on tree, 29 best solution, best possible 25.8 (28.57 seconds)
Cbc0010I After 36300 nodes, 3146 on tree, 29 best solution, best possible 25.8 (28.62 seconds)
Cbc0010I After 36400 nodes, 3132 on tree, 29 best solution, best possible 25.8 (28.67 seconds)
Cbc0010I After 36500 nodes, 3135 on tree, 29 best solution, best possible 25.8 (28.72 seconds)
Cbc0010I After 36600 nodes, 3144 on tree, 29 best solution, best possible 25.8 (28.78 seconds)
Cbc0010I After 36700 nodes, 3139 on tree, 29 best solution, best possible 25.8 (28.83 seconds)
Cbc0010I After 36800 nodes, 3130 on tree, 29 best solution, best possible 25.8 (28.88 seconds)
Cbc0010I After 36900 nodes, 3165 on tree, 29 best solution, best possible 25.8 (28.93 seconds)
Cbc0010I After 37000 nodes, 3141 on tree, 29 best solution, best possible 25.8 (28.99 seconds)
Cbc0010I After 37100 nodes, 3186 on tree, 29 best solution, best possible 25.8 (29.08 seconds)
Cbc0010I After 37200 nodes, 3175 on tree, 29 best solution, best possible 25.8 (29.20 seconds)
Cbc0010I After 37300 nodes, 3196 on tree, 29 best solution, best possible 25.8 (29.29 seconds)
Cbc0010I After 37400 nodes, 3184 on tree, 29 best solution, best possible 25.8 (29.39 seconds)
Cbc0010I After 37500 nodes, 3196 on tree, 29 best solution, best possible 25.8 (29.49 seconds)
Cbc0010I After 37600 nodes, 3186 on tree, 29 best solution, best possible 25.8 (29.60 seconds)
Cbc0010I After 37700 nodes, 3183 on tree, 29 best solution, best possible 25.8 (29.70 seconds)
Cbc0010I After 37800 nodes, 3174 on tree, 29 best solution, best possible 25.8 (29.83 seconds)
Cbc0010I After 37900 nodes, 3180 on tree, 29 best solution, best possible 25.8 (29.94 seconds)
Cbc0010I After 38000 nodes, 3182 on tree, 29 best solution, best possible 25.8 (30.05 seconds)
Cbc0010I After 38100 nodes, 3195 on tree, 29 best solution, best possible 25.8 (30.15 seconds)
Cbc0010I After 38200 nodes, 3195 on tree, 29 best solution, best possible 25.8 (30.24 seconds)
Cbc0010I After 38300 nodes, 3199 on tree, 29 best solution, best possible 25.8 (30.34 seconds)
Cbc0010I After 38400 nodes, 3199 on tree, 29 best solution, best possible 25.8 (30.43 seconds)
Cbc0010I After 38500 nodes, 3205 on tree, 29 best solution, best possible 25.8 (30.53 seconds)
Cbc0010I After 38600 nodes, 3208 on tree, 29 best solution, best possible 25.8 (30.62 seconds)
Cbc0010I After 38700 nodes, 3198 on tree, 29 best solution, best possible 25.8 (30.72 seconds)
Cbc0010I After 38800 nodes, 3193 on tree, 29 best solution, best possible 25.8 (30.82 seconds)
Cbc0010I After 38900 nodes, 3194 on tree, 29 best solution, best possible 25.8 (30.91 seconds)
Cbc0010I After 39000 nodes, 3192 on tree, 29 best solution, best possible 25.8 (31.01 seconds)
Cbc0010I After 39100 nodes, 3202 on tree, 29 best solution, best possible 25.8 (31.10 seconds)
Cbc0010I After 39200 nodes, 3196 on tree, 29 best solution, best possible 25.8 (31.19 seconds)
Cbc0010I After 39300 nodes, 3195 on tree, 29 best solution, best possible 25.8 (31.28 seconds)
Cbc0010I After 39400 nodes, 3186 on tree, 29 best solution, best possible 25.8 (31.38 seconds)
Cbc0010I After 39500 nodes, 3219 on tree, 29 best solution, best possible 25.8 (31.46 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 144 columns
Cbc0010I After 39600 nodes, 3212 on tree, 29 best solution, best possible 25.8 (31.56 seconds)
Cbc0010I After 39700 nodes, 3202 on tree, 29 best solution, best possible 25.8 (31.66 seconds)
Cbc0010I After 39800 nodes, 3196 on tree, 29 best solution, best possible 25.8 (31.75 seconds)
Cbc0010I After 39900 nodes, 3190 on tree, 29 best solution, best possible 25.8 (31.85 seconds)
Cbc0010I After 40000 nodes, 3187 on tree, 29 best solution, best possible 25.8 (31.94 seconds)
Cbc0010I After 40100 nodes, 3184 on tree, 29 best solution, best possible 25.8 (32.04 seconds)
Cbc0010I After 40200 nodes, 3183 on tree, 29 best solution, best possible 25.8 (32.14 seconds)
Cbc0010I After 40300 nodes, 3177 on tree, 29 best solution, best possible 25.8 (32.24 seconds)
Cbc0010I After 40400 nodes, 3180 on tree, 29 best solution, best possible 25.8 (32.35 seconds)
Cbc0010I After 40500 nodes, 3174 on tree, 29 best solution, best possible 25.8 (32.45 seconds)
Cbc0010I After 40600 nodes, 3194 on tree, 29 best solution, best possible 25.8 (32.55 seconds)
Cbc0010I After 40700 nodes, 3184 on tree, 29 best solution, best possible 25.8 (32.65 seconds)
Cbc0010I After 40800 nodes, 3184 on tree, 29 best solution, best possible 25.8 (32.75 seconds)
Cbc0010I After 40900 nodes, 3170 on tree, 29 best solution, best possible 25.8 (32.86 seconds)
Cbc0010I After 41000 nodes, 3163 on tree, 29 best solution, best possible 25.8 (32.97 seconds)
Cbc0010I After 41100 nodes, 3193 on tree, 29 best solution, best possible 25.8 (33.02 seconds)
Cbc0010I After 41200 nodes, 3180 on tree, 29 best solution, best possible 25.8 (33.07 seconds)
Cbc0010I After 41300 nodes, 3179 on tree, 29 best solution, best possible 25.8 (33.12 seconds)
Cbc0010I After 41400 nodes, 3184 on tree, 29 best solution, best possible 25.8 (33.17 seconds)
Cbc0010I After 41500 nodes, 3179 on tree, 29 best solution, best possible 25.8 (33.21 seconds)
Cbc0010I After 41600 nodes, 3170 on tree, 29 best solution, best possible 25.8 (33.26 seconds)
Cbc0010I After 41700 nodes, 3164 on tree, 29 best solution, best possible 25.8 (33.32 seconds)
Cbc0010I After 41800 nodes, 3170 on tree, 29 best solution, best possible 25.8 (33.37 seconds)
Cbc0010I After 41900 nodes, 3169 on tree, 29 best solution, best possible 25.8 (33.42 seconds)
Cbc0010I After 42000 nodes, 3177 on tree, 29 best solution, best possible 25.8 (33.48 seconds)
Cbc0010I After 42100 nodes, 3163 on tree, 29 best solution, best possible 25.8 (33.53 seconds)
Cbc0010I After 42200 nodes, 3174 on tree, 29 best solution, best possible 25.8 (33.58 seconds)
Cbc0010I After 42300 nodes, 3170 on tree, 29 best solution, best possible 25.8 (33.64 seconds)
Cbc0010I After 42400 nodes, 3173 on tree, 29 best solution, best possible 25.8 (33.69 seconds)
Cbc0010I After 42500 nodes, 3175 on tree, 29 best solution, best possible 25.8 (33.73 seconds)
Cbc0010I After 42600 nodes, 3170 on tree, 29 best solution, best possible 25.8 (33.78 seconds)
Cbc0010I After 42700 nodes, 3168 on tree, 29 best solution, best possible 25.8 (33.84 seconds)
Cbc0010I After 42800 nodes, 3167 on tree, 29 best solution, best possible 25.8 (33.89 seconds)
Cbc0010I After 42900 nodes, 3164 on tree, 29 best solution, best possible 25.8 (33.94 seconds)
Cbc0010I After 43000 nodes, 3178 on tree, 29 best solution, best possible 25.8 (33.98 seconds)
Cbc0010I After 43100 nodes, 3171 on tree, 29 best solution, best possible 25.8 (34.03 seconds)
Cbc0010I After 43200 nodes, 3175 on tree, 29 best solution, best possible 25.8 (34.08 seconds)
Cbc0010I After 43300 nodes, 3165 on tree, 29 best solution, best possible 25.8 (34.13 seconds)
Cbc0010I After 43400 nodes, 3163 on tree, 29 best solution, best possible 25.8 (34.18 seconds)
Cbc0010I After 43500 nodes, 3176 on tree, 29 best solution, best possible 25.8 (34.23 seconds)
Cbc0010I After 43600 nodes, 3177 on tree, 29 best solution, best possible 25.8 (34.28 seconds)
Cbc0010I After 43700 nodes, 3168 on tree, 29 best solution, best possible 25.8 (34.32 seconds)
Cbc0010I After 43800 nodes, 3165 on tree, 29 best solution, best possible 25.8 (34.37 seconds)
Cbc0010I After 43900 nodes, 3169 on tree, 29 best solution, best possible 25.8 (34.42 seconds)
Cbc0010I After 44000 nodes, 3172 on tree, 29 best solution, best possible 25.8 (34.47 seconds)
Cbc0010I After 44100 nodes, 3166 on tree, 29 best solution, best possible 25.8 (34.53 seconds)
Cbc0010I After 44200 nodes, 3170 on tree, 29 best solution, best possible 25.8 (34.58 seconds)
Cbc0010I After 44300 nodes, 3168 on tree, 29 best solution, best possible 25.8 (34.62 seconds)
Cbc0010I After 44400 nodes, 3169 on tree, 29 best solution, best possible 25.8 (34.67 seconds)
Cbc0010I After 44500 nodes, 3172 on tree, 29 best solution, best possible 25.8 (34.72 seconds)
Cbc0010I After 44600 nodes, 3170 on tree, 29 best solution, best possible 25.8 (34.77 seconds)
Cbc0010I After 44700 nodes, 3169 on tree, 29 best solution, best possible 25.8 (34.82 seconds)
Cbc0010I After 44800 nodes, 3166 on tree, 29 best solution, best possible 25.8 (34.87 seconds)
Cbc0010I After 44900 nodes, 3168 on tree, 29 best solution, best possible 25.8 (34.91 seconds)
Cbc0010I After 45000 nodes, 3170 on tree, 29 best solution, best possible 25.8 (34.95 seconds)
Cbc0010I After 45100 nodes, 3265 on tree, 29 best solution, best possible 25.8 (35.02 seconds)
Cbc0010I After 45200 nodes, 3286 on tree, 29 best solution, best possible 25.8 (35.13 seconds)
Cbc0010I After 45300 nodes, 3282 on tree, 29 best solution, best possible 25.8 (35.25 seconds)
Cbc0010I After 45400 nodes, 3276 on tree, 29 best solution, best possible 25.8 (35.36 seconds)
Cbc0010I After 45500 nodes, 3276 on tree, 29 best solution, best possible 25.8 (35.47 seconds)
Cbc0010I After 45600 nodes, 3277 on tree, 29 best solution, best possible 25.8 (35.57 seconds)
Cbc0010I After 45700 nodes, 3272 on tree, 29 best solution, best possible 25.8 (35.68 seconds)
Cbc0010I After 45800 nodes, 3276 on tree, 29 best solution, best possible 25.8 (35.79 seconds)
Cbc0010I After 45900 nodes, 3277 on tree, 29 best solution, best possible 25.8 (35.90 seconds)
Cbc0010I After 46000 nodes, 3277 on tree, 29 best solution, best possible 25.8 (35.99 seconds)
Cbc0010I After 46100 nodes, 3269 on tree, 29 best solution, best possible 25.8 (36.10 seconds)
Cbc0010I After 46200 nodes, 3266 on tree, 29 best solution, best possible 25.8 (36.21 seconds)
Cbc0010I After 46300 nodes, 3275 on tree, 29 best solution, best possible 25.8 (36.31 seconds)
Cbc0010I After 46400 nodes, 3271 on tree, 29 best solution, best possible 25.8 (36.41 seconds)
Cbc0010I After 46500 nodes, 3269 on tree, 29 best solution, best possible 25.8 (36.52 seconds)
Cbc0010I After 46600 nodes, 3266 on tree, 29 best solution, best possible 25.8 (36.61 seconds)
Cbc0010I After 46700 nodes, 3270 on tree, 29 best solution, best possible 25.8 (36.72 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 151 columns
Cbc0010I After 46800 nodes, 3351 on tree, 29 best solution, best possible 25.8 (36.79 seconds)
Cbc0010I After 46900 nodes, 3361 on tree, 29 best solution, best possible 25.8 (36.88 seconds)
Cbc0010I After 47000 nodes, 3365 on tree, 29 best solution, best possible 25.8 (36.96 seconds)
Cbc0010I After 47100 nodes, 3359 on tree, 29 best solution, best possible 25.8 (37.05 seconds)
Cbc0010I After 47200 nodes, 3330 on tree, 29 best solution, best possible 25.8 (37.16 seconds)
Cbc0010I After 47300 nodes, 3264 on tree, 29 best solution, best possible 25.8 (37.30 seconds)
Cbc0010I After 47400 nodes, 3283 on tree, 29 best solution, best possible 25.8 (37.41 seconds)
Cbc0010I After 47500 nodes, 3296 on tree, 29 best solution, best possible 25.8 (37.52 seconds)
Cbc0010I After 47600 nodes, 3290 on tree, 29 best solution, best possible 25.8 (37.64 seconds)
Cbc0010I After 47700 nodes, 3282 on tree, 29 best solution, best possible 25.8 (37.76 seconds)
Cbc0010I After 47800 nodes, 3271 on tree, 29 best solution, best possible 25.8 (37.88 seconds)
Cbc0010I After 47900 nodes, 3272 on tree, 29 best solution, best possible 25.8 (37.99 seconds)
Cbc0010I After 48000 nodes, 3263 on tree, 29 best solution, best possible 25.8 (38.11 seconds)
Cbc0010I After 48100 nodes, 3269 on tree, 29 best solution, best possible 25.8 (38.21 seconds)
Cbc0010I After 48200 nodes, 3323 on tree, 29 best solution, best possible 25.8 (38.29 seconds)
Cbc0010I After 48300 nodes, 3334 on tree, 29 best solution, best possible 25.8 (38.38 seconds)
Cbc0010I After 48400 nodes, 3316 on tree, 29 best solution, best possible 25.8 (38.47 seconds)
Cbc0010I After 48500 nodes, 3314 on tree, 29 best solution, best possible 25.8 (38.57 seconds)
Cbc0010I After 48600 nodes, 3308 on tree, 29 best solution, best possible 25.8 (38.67 seconds)
Cbc0010I After 48700 nodes, 3316 on tree, 29 best solution, best possible 25.8 (38.75 seconds)
Cbc0010I After 48800 nodes, 3307 on tree, 29 best solution, best possible 25.8 (38.85 seconds)
Cbc0010I After 48900 nodes, 3301 on tree, 29 best solution, best possible 25.8 (38.96 seconds)
Cbc0010I After 49000 nodes, 3298 on tree, 29 best solution, best possible 25.8 (39.07 seconds)
Cbc0010I After 49100 nodes, 3294 on tree, 29 best solution, best possible 25.8 (39.11 seconds)
Cbc0010I After 49200 nodes, 3288 on tree, 29 best solution, best possible 25.8 (39.16 seconds)
Cbc0010I After 49300 nodes, 3288 on tree, 29 best solution, best possible 25.8 (39.20 seconds)
Cbc0010I After 49400 nodes, 3294 on tree, 29 best solution, best possible 25.8 (39.25 seconds)
Cbc0010I After 49500 nodes, 3287 on tree, 29 best solution, best possible 25.8 (39.29 seconds)
Cbc0010I After 49600 nodes, 3292 on tree, 29 best solution, best possible 25.8 (39.33 seconds)
Cbc0010I After 49700 nodes, 3301 on tree, 29 best solution, best possible 25.8 (39.38 seconds)
Cbc0010I After 49800 nodes, 3299 on tree, 29 best solution, best possible 25.8 (39.42 seconds)
Cbc0010I After 49900 nodes, 3293 on tree, 29 best solution, best possible 25.8 (39.47 seconds)
Cbc0010I After 50000 nodes, 3297 on tree, 29 best solution, best possible 25.8 (39.51 seconds)
Cbc0010I After 50100 nodes, 3298 on tree, 29 best solution, best possible 25.8 (39.54 seconds)
Cbc0010I After 50200 nodes, 3292 on tree, 29 best solution, best possible 25.8 (39.59 seconds)
Cbc0010I After 50300 nodes, 3291 on tree, 29 best solution, best possible 25.8 (39.64 seconds)
Cbc0010I After 50400 nodes, 3289 on tree, 29 best solution, best possible 25.8 (39.68 seconds)
Cbc0010I After 50500 nodes, 3297 on tree, 29 best solution, best possible 25.8 (39.73 seconds)
Cbc0010I After 50600 nodes, 3286 on tree, 29 best solution, best possible 25.8 (39.78 seconds)
Cbc0010I After 50700 nodes, 3291 on tree, 29 best solution, best possible 25.8 (39.82 seconds)
Cbc0010I After 50800 nodes, 3282 on tree, 29 best solution, best possible 25.8 (39.86 seconds)
Cbc0010I After 50900 nodes, 3300 on tree, 29 best solution, best possible 25.8 (39.91 seconds)
Cbc0010I After 51000 nodes, 3299 on tree, 29 best solution, best possible 25.8 (39.96 seconds)
Cbc0010I After 51100 nodes, 3307 on tree, 29 best solution, best possible 25.8 (40.00 seconds)
Cbc0010I After 51200 nodes, 3297 on tree, 29 best solution, best possible 25.8 (40.04 seconds)
Cbc0010I After 51300 nodes, 3294 on tree, 29 best solution, best possible 25.8 (40.10 seconds)
Cbc0010I After 51400 nodes, 3292 on tree, 29 best solution, best possible 25.8 (40.14 seconds)
Cbc0010I After 51500 nodes, 3296 on tree, 29 best solution, best possible 25.8 (40.19 seconds)
Cbc0010I After 51600 nodes, 3295 on tree, 29 best solution, best possible 25.8 (40.24 seconds)
Cbc0010I After 51700 nodes, 3303 on tree, 29 best solution, best possible 25.8 (40.29 seconds)
Cbc0010I After 51800 nodes, 3290 on tree, 29 best solution, best possible 25.8 (40.34 seconds)
Cbc0010I After 51900 nodes, 3295 on tree, 29 best solution, best possible 25.8 (40.39 seconds)
Cbc0010I After 52000 nodes, 3292 on tree, 29 best solution, best possible 25.8 (40.44 seconds)
Cbc0010I After 52100 nodes, 3299 on tree, 29 best solution, best possible 25.8 (40.49 seconds)
Cbc0010I After 52200 nodes, 3299 on tree, 29 best solution, best possible 25.8 (40.53 seconds)
Cbc0010I After 52300 nodes, 3306 on tree, 29 best solution, best possible 25.8 (40.59 seconds)
Cbc0010I After 52400 nodes, 3293 on tree, 29 best solution, best possible 25.8 (40.63 seconds)
Cbc0010I After 52500 nodes, 3293 on tree, 29 best solution, best possible 25.8 (40.68 seconds)
Cbc0010I After 52600 nodes, 3300 on tree, 29 best solution, best possible 25.8 (40.73 seconds)
Cbc0010I After 52700 nodes, 3298 on tree, 29 best solution, best possible 25.8 (40.79 seconds)
Cbc0010I After 52800 nodes, 3290 on tree, 29 best solution, best possible 25.8 (40.84 seconds)
Cbc0010I After 52900 nodes, 3291 on tree, 29 best solution, best possible 25.8 (40.89 seconds)
Cbc0010I After 53000 nodes, 3290 on tree, 29 best solution, best possible 25.8 (40.95 seconds)
Cbc0010I After 53100 nodes, 3386 on tree, 29 best solution, best possible 25.8 (41.01 seconds)
Cbc0010I After 53200 nodes, 3408 on tree, 29 best solution, best possible 25.8 (41.09 seconds)
Cbc0010I After 53300 nodes, 3420 on tree, 29 best solution, best possible 25.8 (41.20 seconds)
Cbc0010I After 53400 nodes, 3411 on tree, 29 best solution, best possible 25.8 (41.31 seconds)
Cbc0010I After 53500 nodes, 3415 on tree, 29 best solution, best possible 25.8 (41.41 seconds)
Cbc0010I After 53600 nodes, 3405 on tree, 29 best solution, best possible 25.8 (41.50 seconds)
Cbc0010I After 53700 nodes, 3404 on tree, 29 best solution, best possible 25.8 (41.60 seconds)
Cbc0010I After 53800 nodes, 3398 on tree, 29 best solution, best possible 25.8 (41.71 seconds)
Cbc0010I After 53900 nodes, 3397 on tree, 29 best solution, best possible 25.8 (41.82 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 152 columns
Cbc0010I After 54000 nodes, 3398 on tree, 29 best solution, best possible 25.8 (41.93 seconds)
Cbc0010I After 54100 nodes, 3395 on tree, 29 best solution, best possible 25.8 (42.03 seconds)
Cbc0010I After 54200 nodes, 3400 on tree, 29 best solution, best possible 25.8 (42.13 seconds)
Cbc0010I After 54300 nodes, 3398 on tree, 29 best solution, best possible 25.8 (42.24 seconds)
Cbc0010I After 54400 nodes, 3399 on tree, 29 best solution, best possible 25.8 (42.35 seconds)
Cbc0010I After 54500 nodes, 3392 on tree, 29 best solution, best possible 25.8 (42.46 seconds)
Cbc0010I After 54600 nodes, 3396 on tree, 29 best solution, best possible 25.8 (42.56 seconds)
Cbc0010I After 54700 nodes, 3401 on tree, 29 best solution, best possible 25.8 (42.66 seconds)
Cbc0010I After 54800 nodes, 3408 on tree, 29 best solution, best possible 25.8 (42.76 seconds)
Cbc0010I After 54900 nodes, 3414 on tree, 29 best solution, best possible 25.8 (42.86 seconds)
Cbc0010I After 55000 nodes, 3404 on tree, 29 best solution, best possible 25.8 (42.96 seconds)
Cbc0010I After 55100 nodes, 3404 on tree, 29 best solution, best possible 25.8 (43.06 seconds)
Cbc0010I After 55200 nodes, 3400 on tree, 29 best solution, best possible 25.8 (43.17 seconds)
Cbc0010I After 55300 nodes, 3430 on tree, 29 best solution, best possible 25.8 (43.25 seconds)
Cbc0010I After 55400 nodes, 3414 on tree, 29 best solution, best possible 25.8 (43.35 seconds)
Cbc0010I After 55500 nodes, 3416 on tree, 29 best solution, best possible 25.8 (43.45 seconds)
Cbc0010I After 55600 nodes, 3401 on tree, 29 best solution, best possible 25.8 (43.54 seconds)
Cbc0010I After 55700 nodes, 3410 on tree, 29 best solution, best possible 25.8 (43.62 seconds)
Cbc0010I After 55800 nodes, 3423 on tree, 29 best solution, best possible 25.8 (43.71 seconds)
Cbc0010I After 55900 nodes, 3427 on tree, 29 best solution, best possible 25.8 (43.80 seconds)
Cbc0010I After 56000 nodes, 3414 on tree, 29 best solution, best possible 25.8 (43.89 seconds)
Cbc0010I After 56100 nodes, 3412 on tree, 29 best solution, best possible 25.8 (43.97 seconds)
Cbc0010I After 56200 nodes, 3410 on tree, 29 best solution, best possible 25.8 (44.07 seconds)
Cbc0010I After 56300 nodes, 3419 on tree, 29 best solution, best possible 25.8 (44.16 seconds)
Cbc0010I After 56400 nodes, 3401 on tree, 29 best solution, best possible 25.8 (44.25 seconds)
Cbc0010I After 56500 nodes, 3407 on tree, 29 best solution, best possible 25.8 (44.34 seconds)
Cbc0010I After 56600 nodes, 3401 on tree, 29 best solution, best possible 25.8 (44.43 seconds)
Cbc0010I After 56700 nodes, 3398 on tree, 29 best solution, best possible 25.8 (44.52 seconds)
Cbc0010I After 56800 nodes, 3402 on tree, 29 best solution, best possible 25.8 (44.62 seconds)
Cbc0010I After 56900 nodes, 3401 on tree, 29 best solution, best possible 25.8 (44.71 seconds)
Cbc0010I After 57000 nodes, 3405 on tree, 29 best solution, best possible 25.8 (44.80 seconds)
Cbc0010I After 57100 nodes, 3500 on tree, 29 best solution, best possible 25.8 (44.86 seconds)
Cbc0010I After 57200 nodes, 3503 on tree, 29 best solution, best possible 25.8 (44.95 seconds)
Cbc0010I After 57300 nodes, 3502 on tree, 29 best solution, best possible 25.8 (45.05 seconds)
Cbc0010I After 57400 nodes, 3512 on tree, 29 best solution, best possible 25.8 (45.13 seconds)
Cbc0010I After 57500 nodes, 3511 on tree, 29 best solution, best possible 25.8 (45.22 seconds)
Cbc0010I After 57600 nodes, 3511 on tree, 29 best solution, best possible 25.8 (45.31 seconds)
Cbc0010I After 57700 nodes, 3536 on tree, 29 best solution, best possible 25.8 (45.39 seconds)
Cbc0010I After 57800 nodes, 3531 on tree, 29 best solution, best possible 25.8 (45.48 seconds)
Cbc0010I After 57900 nodes, 3514 on tree, 29 best solution, best possible 25.8 (45.57 seconds)
Cbc0010I After 58000 nodes, 3507 on tree, 29 best solution, best possible 25.8 (45.66 seconds)
Cbc0010I After 58100 nodes, 3510 on tree, 29 best solution, best possible 25.8 (45.74 seconds)
Cbc0010I After 58200 nodes, 3505 on tree, 29 best solution, best possible 25.8 (45.82 seconds)
Cbc0010I After 58300 nodes, 3515 on tree, 29 best solution, best possible 25.8 (45.90 seconds)
Cbc0010I After 58400 nodes, 3549 on tree, 29 best solution, best possible 25.8 (45.97 seconds)
Cbc0010I After 58500 nodes, 3555 on tree, 29 best solution, best possible 25.8 (46.05 seconds)
Cbc0010I After 58600 nodes, 3543 on tree, 29 best solution, best possible 25.8 (46.13 seconds)
Cbc0010I After 58700 nodes, 3535 on tree, 29 best solution, best possible 25.8 (46.21 seconds)
Cbc0010I After 58800 nodes, 3526 on tree, 29 best solution, best possible 25.8 (46.30 seconds)
Cbc0010I After 58900 nodes, 3523 on tree, 29 best solution, best possible 25.8 (46.39 seconds)
Cbc0010I After 59000 nodes, 3537 on tree, 29 best solution, best possible 25.8 (46.48 seconds)
Cbc0010I After 59100 nodes, 3522 on tree, 29 best solution, best possible 25.8 (46.56 seconds)
Cbc0010I After 59200 nodes, 3519 on tree, 29 best solution, best possible 25.8 (46.66 seconds)
Cbc0010I After 59300 nodes, 3520 on tree, 29 best solution, best possible 25.8 (46.75 seconds)
Cbc0010I After 59400 nodes, 3516 on tree, 29 best solution, best possible 25.8 (46.84 seconds)
Cbc0010I After 59500 nodes, 3547 on tree, 29 best solution, best possible 25.8 (46.91 seconds)
Cbc0010I After 59600 nodes, 3553 on tree, 29 best solution, best possible 25.8 (46.98 seconds)
Cbc0010I After 59700 nodes, 3530 on tree, 29 best solution, best possible 25.8 (47.07 seconds)
Cbc0010I After 59800 nodes, 3521 on tree, 29 best solution, best possible 25.8 (47.17 seconds)
Cbc0010I After 59900 nodes, 3522 on tree, 29 best solution, best possible 25.8 (47.26 seconds)
Cbc0010I After 60000 nodes, 3511 on tree, 29 best solution, best possible 25.8 (47.35 seconds)
Cbc0010I After 60100 nodes, 3514 on tree, 29 best solution, best possible 25.8 (47.43 seconds)
Cbc0010I After 60200 nodes, 3535 on tree, 29 best solution, best possible 25.8 (47.51 seconds)
Cbc0010I After 60300 nodes, 3521 on tree, 29 best solution, best possible 25.8 (47.60 seconds)
Cbc0010I After 60400 nodes, 3519 on tree, 29 best solution, best possible 25.8 (47.70 seconds)
Cbc0010I After 60500 nodes, 3518 on tree, 29 best solution, best possible 25.8 (47.78 seconds)
Cbc0010I After 60600 nodes, 3511 on tree, 29 best solution, best possible 25.8 (47.87 seconds)
Cbc0010I After 60700 nodes, 3542 on tree, 29 best solution, best possible 25.8 (47.94 seconds)
Cbc0010I After 60800 nodes, 3541 on tree, 29 best solution, best possible 25.8 (48.03 seconds)
Cbc0010I After 60900 nodes, 3549 on tree, 29 best solution, best possible 25.8 (48.11 seconds)
Cbc0010I After 61000 nodes, 3545 on tree, 29 best solution, best possible 25.8 (48.20 seconds)
Cbc0010I After 61100 nodes, 3631 on tree, 29 best solution, best possible 25.8 (48.25 seconds)
Cbc0010I After 61200 nodes, 3632 on tree, 29 best solution, best possible 25.8 (48.32 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 140 columns
Cbc0010I After 61300 nodes, 3651 on tree, 29 best solution, best possible 25.8 (48.40 seconds)
Cbc0010I After 61400 nodes, 3643 on tree, 29 best solution, best possible 25.8 (48.51 seconds)
Cbc0010I After 61500 nodes, 3659 on tree, 29 best solution, best possible 25.8 (48.61 seconds)
Cbc0010I After 61600 nodes, 3662 on tree, 29 best solution, best possible 25.8 (48.69 seconds)
Cbc0010I After 61700 nodes, 3650 on tree, 29 best solution, best possible 25.8 (48.80 seconds)
Cbc0010I After 61800 nodes, 3649 on tree, 29 best solution, best possible 25.8 (48.89 seconds)
Cbc0010I After 61900 nodes, 3650 on tree, 29 best solution, best possible 25.8 (48.98 seconds)
Cbc0010I After 62000 nodes, 3643 on tree, 29 best solution, best possible 25.8 (49.10 seconds)
Cbc0010I After 62100 nodes, 3638 on tree, 29 best solution, best possible 25.8 (49.19 seconds)
Cbc0010I After 62200 nodes, 3650 on tree, 29 best solution, best possible 25.8 (49.28 seconds)
Cbc0010I After 62300 nodes, 3650 on tree, 29 best solution, best possible 25.8 (49.38 seconds)
Cbc0010I After 62400 nodes, 3638 on tree, 29 best solution, best possible 25.8 (49.48 seconds)
Cbc0010I After 62500 nodes, 3643 on tree, 29 best solution, best possible 25.8 (49.60 seconds)
Cbc0010I After 62600 nodes, 3645 on tree, 29 best solution, best possible 25.8 (49.71 seconds)
Cbc0010I After 62700 nodes, 3642 on tree, 29 best solution, best possible 25.8 (49.82 seconds)
Cbc0010I After 62800 nodes, 3637 on tree, 29 best solution, best possible 25.8 (49.93 seconds)
Cbc0010I After 62900 nodes, 3654 on tree, 29 best solution, best possible 25.8 (50.03 seconds)
Cbc0010I After 63000 nodes, 3656 on tree, 29 best solution, best possible 25.8 (50.13 seconds)
Cbc0010I After 63100 nodes, 3641 on tree, 29 best solution, best possible 25.8 (50.23 seconds)
Cbc0010I After 63200 nodes, 3637 on tree, 29 best solution, best possible 25.8 (50.34 seconds)
Cbc0010I After 63300 nodes, 3634 on tree, 29 best solution, best possible 25.8 (50.44 seconds)
Cbc0010I After 63400 nodes, 3647 on tree, 29 best solution, best possible 25.8 (50.54 seconds)
Cbc0010I After 63500 nodes, 3631 on tree, 29 best solution, best possible 25.8 (50.65 seconds)
Cbc0010I After 63600 nodes, 3648 on tree, 29 best solution, best possible 25.8 (50.74 seconds)
Cbc0010I After 63700 nodes, 3641 on tree, 29 best solution, best possible 25.8 (50.85 seconds)
Cbc0010I After 63800 nodes, 3628 on tree, 29 best solution, best possible 25.8 (50.96 seconds)
Cbc0010I After 63900 nodes, 3655 on tree, 29 best solution, best possible 25.8 (51.05 seconds)
Cbc0010I After 64000 nodes, 3650 on tree, 29 best solution, best possible 25.8 (51.16 seconds)
Cbc0010I After 64100 nodes, 3649 on tree, 29 best solution, best possible 25.8 (51.27 seconds)
Cbc0010I After 64200 nodes, 3650 on tree, 29 best solution, best possible 25.8 (51.37 seconds)
Cbc0010I After 64300 nodes, 3642 on tree, 29 best solution, best possible 25.8 (51.48 seconds)
Cbc0010I After 64400 nodes, 3646 on tree, 29 best solution, best possible 25.8 (51.59 seconds)
Cbc0010I After 64500 nodes, 3635 on tree, 29 best solution, best possible 25.8 (51.71 seconds)
Cbc0010I After 64600 nodes, 3639 on tree, 29 best solution, best possible 25.8 (51.81 seconds)
Cbc0010I After 64700 nodes, 3641 on tree, 29 best solution, best possible 25.8 (51.90 seconds)
Cbc0038I Full problem 100 rows 2550 columns, reduced to 90 rows 152 columns
Cbc0010I After 64800 nodes, 3643 on tree, 29 best solution, best possible 25.8 (52.01 seconds)
Cbc0010I After 64900 nodes, 3663 on tree, 29 best solution, best possible 25.8 (52.11 seconds)
Cbc0010I After 65000 nodes, 3636 on tree, 29 best solution, best possible 25.8 (52.22 seconds)
Cbc0010I After 65100 nodes, 3673 on tree, 29 best solution, best possible 25.8 (52.28 seconds)
Cbc0010I After 65200 nodes, 3676 on tree, 29 best solution, best possible 25.8 (52.33 seconds)
Cbc0010I After 65300 nodes, 3700 on tree, 29 best solution, best possible 25.8 (52.39 seconds)
Cbc0010I After 65400 nodes, 3699 on tree, 29 best solution, best possible 25.8 (52.45 seconds)
Cbc0010I After 65500 nodes, 3699 on tree, 29 best solution, best possible 25.8 (52.52 seconds)
Cbc0010I After 65600 nodes, 3696 on tree, 29 best solution, best possible 25.8 (52.58 seconds)
Cbc0010I After 65700 nodes, 3694 on tree, 29 best solution, best possible 25.8 (52.64 seconds)
Cbc0010I After 65800 nodes, 3720 on tree, 29 best solution, best possible 25.8 (52.70 seconds)
Cbc0010I After 65900 nodes, 3706 on tree, 29 best solution, best possible 25.8 (52.78 seconds)
Cbc0010I After 66000 nodes, 3668 on tree, 29 best solution, best possible 25.8 (52.83 seconds)
Cbc0010I After 66100 nodes, 3661 on tree, 29 best solution, best possible 25.8 (52.89 seconds)
Cbc0010I After 66200 nodes, 3681 on tree, 29 best solution, best possible 25.8 (52.95 seconds)
Cbc0010I After 66300 nodes, 3694 on tree, 29 best solution, best possible 25.8 (53.03 seconds)
Cbc0010I After 66400 nodes, 3690 on tree, 29 best solution, best possible 25.8 (53.12 seconds)
Cbc0010I After 66500 nodes, 3669 on tree, 29 best solution, best possible 25.8 (53.18 seconds)
Cbc0010I After 66600 nodes, 3680 on tree, 29 best solution, best possible 25.8 (53.25 seconds)
Cbc0010I After 66700 nodes, 3668 on tree, 29 best solution, best possible 25.8 (53.31 seconds)
Cbc0010I After 66800 nodes, 3675 on tree, 29 best solution, best possible 25.8 (53.36 seconds)
Cbc0010I After 66900 nodes, 3723 on tree, 29 best solution, best possible 25.8 (53.41 seconds)
Cbc0010I After 67000 nodes, 3717 on tree, 29 best solution, best possible 25.8 (53.46 seconds)
Cbc0010I After 67100 nodes, 3719 on tree, 29 best solution, best possible 25.8 (53.51 seconds)
Cbc0010I After 67200 nodes, 3715 on tree, 29 best solution, best possible 25.8 (53.56 seconds)
Cbc0010I After 67300 nodes, 3721 on tree, 29 best solution, best possible 25.8 (53.61 seconds)
Cbc0010I After 67400 nodes, 3698 on tree, 29 best solution, best possible 25.8 (53.66 seconds)
Cbc0010I After 67500 nodes, 3698 on tree, 29 best solution, best possible 25.8 (53.71 seconds)
Cbc0010I After 67600 nodes, 3689 on tree, 29 best solution, best possible 25.8 (53.77 seconds)
Cbc0010I After 67700 nodes, 3690 on tree, 29 best solution, best possible 25.8 (53.82 seconds)
Cbc0010I After 67800 nodes, 3697 on tree, 29 best solution, best possible 25.8 (53.87 seconds)
Cbc0010I After 67900 nodes, 3690 on tree, 29 best solution, best possible 25.8 (53.93 seconds)
Cbc0010I After 68000 nodes, 3677 on tree, 29 best solution, best possible 25.8 (53.98 seconds)
Cbc0010I After 68100 nodes, 3681 on tree, 29 best solution, best possible 25.8 (54.04 seconds)
Cbc0010I After 68200 nodes, 3687 on tree, 29 best solution, best possible 25.8 (54.10 seconds)
Cbc0010I After 68300 nodes, 3699 on tree, 29 best solution, best possible 25.8 (54.14 seconds)
Cbc0010I After 68400 nodes, 3706 on tree, 29 best solution, best possible 25.8 (54.19 seconds)
Cbc0010I After 68500 nodes, 3680 on tree, 29 best solution, best possible 25.8 (54.24 seconds)
Cbc0010I After 68600 nodes, 3678 on tree, 29 best solution, best possible 25.8 (54.30 seconds)
Cbc0010I After 68700 nodes, 3682 on tree, 29 best solution, best possible 25.8 (54.36 seconds)
Cbc0010I After 68800 nodes, 3687 on tree, 29 best solution, best possible 25.8 (54.43 seconds)
Cbc0010I After 68900 nodes, 3681 on tree, 29 best solution, best possible 25.8 (54.49 seconds)
Cbc0010I After 69000 nodes, 3696 on tree, 29 best solution, best possible 25.8 (54.56 seconds)
Cbc0010I After 69100 nodes, 3704 on tree, 29 best solution, best possible 25.8 (54.61 seconds)
Cbc0010I After 69200 nodes, 3704 on tree, 29 best solution, best possible 25.8 (54.67 seconds)
Cbc0010I After 69300 nodes, 3702 on tree, 29 best solution, best possible 25.8 (54.72 seconds)
Cbc0010I After 69400 nodes, 3695 on tree, 29 best solution, best possible 25.8 (54.78 seconds)
Cbc0010I After 69500 nodes, 3702 on tree, 29 best solution, best possible 25.8 (54.83 seconds)
Cbc0010I After 69600 nodes, 3697 on tree, 29 best solution, best possible 25.8 (54.89 seconds)
Cbc0010I After 69700 nodes, 3699 on tree, 29 best solution, best possible 25.8 (54.95 seconds)
Cbc0010I After 69800 nodes, 3697 on tree, 29 best solution, best possible 25.8 (55.00 seconds)
Cbc0010I After 69900 nodes, 3702 on tree, 29 best solution, best possible 25.8 (55.06 seconds)
Cbc0010I After 70000 nodes, 3702 on tree, 29 best solution, best possible 25.8 (55.11 seconds)
Cbc0010I After 70100 nodes, 3692 on tree, 29 best solution, best possible 25.8 (55.16 seconds)
Cbc0010I After 70200 nodes, 3695 on tree, 29 best solution, best possible 25.8 (55.21 seconds)
Cbc0010I After 70300 nodes, 3692 on tree, 29 best solution, best possible 25.8 (55.25 seconds)
Cbc0010I After 70400 nodes, 3692 on tree, 29 best solution, best possible 25.8 (55.31 seconds)
Cbc0010I After 70500 nodes, 3697 on tree, 29 best solution, best possible 25.8 (55.36 seconds)
Cbc0010I After 70600 nodes, 3708 on tree, 29 best solution, best possible 25.8 (55.41 seconds)
Cbc0010I After 70700 nodes, 3694 on tree, 29 best solution, best possible 25.8 (55.46 seconds)
Cbc0010I After 70800 nodes, 3704 on tree, 29 best solution, best possible 25.8 (55.51 seconds)
Cbc0010I After 70900 nodes, 3694 on tree, 29 best solution, best possible 25.8 (55.56 seconds)
Cbc0010I After 71000 nodes, 3700 on tree, 29 best solution, best possible 25.8 (55.62 seconds)
Cbc0010I After 71100 nodes, 3696 on tree, 29 best solution, best possible 25.8 (55.69 seconds)
Cbc0010I After 71200 nodes, 3692 on tree, 29 best solution, best possible 25.8 (55.75 seconds)
Cbc0010I After 71300 nodes, 3692 on tree, 29 best solution, best possible 25.8 (55.80 seconds)
Cbc0010I After 71400 nodes, 3690 on tree, 29 best solution, best possible 25.8 (55.86 seconds)
Cbc0010I After 71500 nodes, 3699 on tree, 29 best solution, best possible 25.8 (55.92 seconds)
Cbc0010I After 71600 nodes, 3693 on tree, 29 best solution, best possible 25.8 (55.96 seconds)
Cbc0010I After 71700 nodes, 3693 on tree, 29 best solution, best possible 25.8 (56.02 seconds)
Cbc0010I After 71800 nodes, 3688 on tree, 29 best solution, best possible 25.8 (56.08 seconds)
Cbc0010I After 71900 nodes, 3693 on tree, 29 best solution, best possible 25.8 (56.14 seconds)
Cbc0010I After 72000 nodes, 3693 on tree, 29 best solution, best possible 25.8 (56.19 seconds)
Cbc0010I After 72100 nodes, 3688 on tree, 29 best solution, best possible 25.8 (56.25 seconds)
Cbc0010I After 72200 nodes, 3690 on tree, 29 best solution, best possible 25.8 (56.30 seconds)
Cbc0010I After 72300 nodes, 3699 on tree, 29 best solution, best possible 25.8 (56.36 seconds)
Cbc0010I After 72400 nodes, 3695 on tree, 29 best solution, best possible 25.8 (56.42 seconds)
Cbc0010I After 72500 nodes, 3696 on tree, 29 best solution, best possible 25.8 (56.48 seconds)
Cbc0010I After 72600 nodes, 3698 on tree, 29 best solution, best possible 25.8 (56.54 seconds)
Cbc0010I After 72700 nodes, 3697 on tree, 29 best solution, best possible 25.8 (56.58 seconds)
Cbc0010I After 72800 nodes, 3694 on tree, 29 best solution, best possible 25.8 (56.64 seconds)
Cbc0010I After 72900 nodes, 3699 on tree, 29 best solution, best possible 25.8 (56.69 seconds)
Cbc0010I After 73000 nodes, 3694 on tree, 29 best solution, best possible 25.8 (56.75 seconds)
Cbc0010I After 73100 nodes, 3714 on tree, 29 best solution, best possible 25.8 (56.80 seconds)
Cbc0010I After 73200 nodes, 3733 on tree, 29 best solution, best possible 25.8 (56.84 seconds)
Cbc0010I After 73300 nodes, 3762 on tree, 29 best solution, best possible 25.8 (56.90 seconds)
Cbc0010I After 73400 nodes, 3730 on tree, 29 best solution, best possible 25.8 (56.95 seconds)
Cbc0010I After 73500 nodes, 3734 on tree, 29 best solution, best possible 25.8 (57.02 seconds)
Cbc0010I After 73600 nodes, 3725 on tree, 29 best solution, best possible 25.8 (57.09 seconds)
Cbc0010I After 73700 nodes, 3715 on tree, 29 best solution, best possible 25.8 (57.13 seconds)
Cbc0010I After 73800 nodes, 3718 on tree, 29 best solution, best possible 25.8 (57.18 seconds)
Cbc0010I After 73900 nodes, 3717 on tree, 29 best solution, best possible 25.8 (57.24 seconds)
Cbc0010I After 74000 nodes, 3714 on tree, 29 best solution, best possible 25.8 (57.29 seconds)
Cbc0010I After 74100 nodes, 3717 on tree, 29 best solution, best possible 25.8 (57.35 seconds)
Cbc0010I After 74200 nodes, 3716 on tree, 29 best solution, best possible 25.8 (57.40 seconds)
Cbc0010I After 74300 nodes, 3743 on tree, 29 best solution, best possible 25.8 (57.46 seconds)
Cbc0010I After 74400 nodes, 3741 on tree, 29 best solution, best possible 25.8 (57.53 seconds)
Cbc0010I After 74500 nodes, 3737 on tree, 29 best solution, best possible 25.8 (57.58 seconds)
Cbc0010I After 74600 nodes, 3764 on tree, 29 best solution, best possible 25.8 (57.65 seconds)
Cbc0010I After 74700 nodes, 3754 on tree, 29 best solution, best possible 25.8 (57.72 seconds)
Cbc0010I After 74800 nodes, 3737 on tree, 29 best solution, best possible 25.8 (57.76 seconds)
Cbc0010I After 74900 nodes, 3733 on tree, 29 best solution, best possible 25.8 (57.81 seconds)
Cbc0010I After 75000 nodes, 3749 on tree, 29 best solution, best possible 25.8 (57.86 seconds)
Cbc0010I After 75100 nodes, 3752 on tree, 29 best solution, best possible 25.8 (57.93 seconds)
Cbc0010I After 75200 nodes, 3733 on tree, 29 best solution, best possible 25.8 (57.97 seconds)
Cbc0010I After 75300 nodes, 3722 on tree, 29 best solution, best possible 25.8 (58.04 seconds)
Cbc0010I After 75400 nodes, 3735 on tree, 29 best solution, best possible 25.8 (58.09 seconds)
Cbc0010I After 75500 nodes, 3786 on tree, 29 best solution, best possible 25.8 (58.16 seconds)
Cbc0010I After 75600 nodes, 3744 on tree, 29 best solution, best possible 25.8 (58.27 seconds)
Cbc0010I After 75700 nodes, 3736 on tree, 29 best solution, best possible 25.8 (58.33 seconds)
Cbc0010I After 75800 nodes, 3728 on tree, 29 best solution, best possible 25.8 (58.39 seconds)
Cbc0010I After 75900 nodes, 3748 on tree, 29 best solution, best possible 25.8 (58.45 seconds)
Cbc0010I After 76000 nodes, 3720 on tree, 29 best solution, best possible 25.8 (58.51 seconds)
Cbc0010I After 76100 nodes, 3741 on tree, 29 best solution, best possible 25.8 (58.58 seconds)
Cbc0010I After 76200 nodes, 3732 on tree, 29 best solution, best possible 25.8 (58.65 seconds)
Cbc0010I After 76300 nodes, 3726 on tree, 29 best solution, best possible 25.8 (58.69 seconds)
Cbc0010I After 76400 nodes, 3723 on tree, 29 best solution, best possible 25.8 (58.73 seconds)
Cbc0010I After 76500 nodes, 3746 on tree, 29 best solution, best possible 25.8 (58.78 seconds)
Cbc0010I After 76600 nodes, 3737 on tree, 29 best solution, best possible 25.8 (58.83 seconds)
Cbc0010I After 76700 nodes, 3751 on tree, 29 best solution, best possible 25.8 (58.88 seconds)
Cbc0010I After 76800 nodes, 3745 on tree, 29 best solution, best possible 25.8 (58.94 seconds)
Cbc0010I After 76900 nodes, 3748 on tree, 29 best solution, best possible 25.8 (59.00 seconds)
Cbc0010I After 77000 nodes, 3740 on tree, 29 best solution, best possible 25.8 (59.06 seconds)
Cbc0010I After 77100 nodes, 3763 on tree, 29 best solution, best possible 25.8 (59.12 seconds)
Cbc0010I After 77200 nodes, 3763 on tree, 29 best solution, best possible 25.8 (59.17 seconds)
Cbc0010I After 77300 nodes, 3761 on tree, 29 best solution, best possible 25.8 (59.22 seconds)
Cbc0010I After 77400 nodes, 3759 on tree, 29 best solution, best possible 25.8 (59.28 seconds)
Cbc0010I After 77500 nodes, 3784 on tree, 29 best solution, best possible 25.8 (59.32 seconds)
Cbc0010I After 77600 nodes, 3775 on tree, 29 best solution, best possible 25.8 (59.37 seconds)
Cbc0010I After 77700 nodes, 3791 on tree, 29 best solution, best possible 25.8 (59.42 seconds)
Cbc0010I After 77800 nodes, 3762 on tree, 29 best solution, best possible 25.8 (59.48 seconds)
Cbc0010I After 77900 nodes, 3800 on tree, 29 best solution, best possible 25.8 (59.53 seconds)
Cbc0010I After 78000 nodes, 3796 on tree, 29 best solution, best possible 25.8 (59.59 seconds)
Cbc0010I After 78100 nodes, 3820 on tree, 29 best solution, best possible 25.8 (59.66 seconds)
Cbc0010I After 78200 nodes, 3815 on tree, 29 best solution, best possible 25.8 (59.73 seconds)
Cbc0010I After 78300 nodes, 3800 on tree, 29 best solution, best possible 25.8 (59.81 seconds)
Cbc0020I Exiting on maximum time
Cbc0005I Partial search - best objective 29 (best possible 25.8), took 1097258 iterations and 78395 nodes (59.91 seconds)
Cbc0032I Strong branching done 107668 times (784559 iterations), fathomed 3230 nodes and fixed 5072 variables
Cbc0035I Maximum depth 882, 83092 variables fixed on reduced cost
Cuts at root node changed objective from 25.8 to 25.8
Probing was tried 10 times and created 534 cuts of which 35 were active after adding rounds of cuts (0.039 seconds)
Gomory was tried 10 times and created 281 cuts of which 0 were active after adding rounds of cuts (0.085 seconds)
Knapsack was tried 10 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.004 seconds)
Clique was tried 10 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)
MixedIntegerRounding2 was tried 10 times and created 42 cuts of which 0 were active after adding rounds of cuts (0.004 seconds)
FlowCover was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
TwoMirCuts was tried 10 times and created 281 cuts of which 0 were active after adding rounds of cuts (0.019 seconds)
ZeroHalf was tried 10 times and created 97 cuts of which 0 were active after adding rounds of cuts (0.014 seconds)
ImplicationCuts was tried 65 times and created 1018 cuts of which 0 were active after adding rounds of cuts (0.007 seconds)
Result - Stopped on time limit
Objective value: 29.00000000
Lower bound: 25.800
Gap: 0.12
Enumerated nodes: 78395
Total iterations: 1097258
Time (CPU seconds): 59.91
Time (Wallclock seconds): 60.17
Total time (CPU seconds): 59.91 (Wallclock seconds): 60.17
cbc 2.10.10: hit a limit, feasible solution returned; objective 29
1.09726e+06 simplex iterations
1097258 barrier iterations
78395 branching nodes
Setup time = 0.003676s
Solver time = 60.170904s
Total time = 60.174614s
absmipgap=3.2, relmipgap=0.110345
GCG outperformes other open-source solvers solving this bin packing instance.