python-mip
python-mip copied to clipboard
coin-or
No solution after strong branching
When running a model with lazy constraints generator enabled I observe that strong branching finds an integer solution but finally there is no solution found. Below you can find log from the solver run:
Welcome to the CBC MILP Solver
Version: Trunk
Build Date: Feb 14 2020
Starting solution of the Linear programming relaxation problem using Dual Simplex
Coin0506I Presolve 2565 (-2323) rows, 9680 (-3902) columns and 161473 (-42575) elements
Clp0014I Perturbing problem by 0.001% of 4.4283328 - largest nonzero change 9.0462078e-07 ( 2.0428022e-05%) - largest zero change 9.046106e-07
Clp0000I Optimal - objective value 5044
Coin0511I After Postsolve, objective 5044, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective 5044 - 1967 iterations time 0.102, Presolve 0.05
Starting MIP optimization
Option for timeMode changed from cpu to elapsed
Option for preprocess changed from sos to off
Option for heuristicsOnOff changed from on to off
maxSavedSolutions was changed from 0 to 10
integerTolerance was changed from 1e-06 to 1e-06
Option for mergeCliques changed from off to after
Option for cliqueCuts changed from ifmove to off
Option for bkcliqueCuts changed from off to ifmove
Option for oddholewcCuts changed from off to ifmove
Continuous objective value is 5044 - 0.00 seconds
Cgl0015I Clique merge extended 0 cliques, 0 were dominated
Cbc0045I Fixing only non-zero variables.
Cbc0045I MIPStart solution provided values for 9114 of 9115 integer variables, 31 variables are still fractional.
Cbc0038I Full problem 4888 rows 13582 columns, reduced to 1768 rows 8884 columns
Cbc0038I Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Cbc0045I Mini branch and bound defined values for remaining variables in 2.02 seconds.
Cbc0045I MIPStart provided solution with cost 10519
Cbc0012I Integer solution of 5244 found by Reduced search after 0 iterations and 0 nodes (2.55 seconds)
Cbc0013I At root node, 0 cuts changed objective from 5044 to 5044 in 1 passes
Cbc0014I Cut generator 0 (LazyConstraints) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1
Cbc0014I Cut generator 1 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 2 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 3 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 4 (BKClique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 5 (OddHoleWC) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 6 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 7 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 8 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 9 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0010I After 0 nodes, 1 on tree, 5244 best solution, best possible 5044 (2.64 seconds)
Cbc0010I After 17 nodes, 12 on tree, 5244 best solution, best possible 5044 (3.65 seconds)
Cbc0010I After 33 nodes, 22 on tree, 5244 best solution, best possible 5044 (4.77 seconds)
Cbc0010I After 48 nodes, 25 on tree, 5244 best solution, best possible 5044 (5.86 seconds)
Cbc0038I Full problem 4888 rows 13582 columns, reduced to 1769 rows 8884 columns
Cbc0044I Reduced cost fixing - 1769 rows, 8884 columns - restarting search
Cbc0012I Integer solution of 5244 found by Previous solution after 0 iterations and 0 nodes (6.54 seconds)
Cbc0031I 36 added rows had average density of 650.05556
Cbc0013I At root node, 36 cuts changed objective from 5044 to 5044 in 10 passes
Cbc0014I Cut generator 0 (LazyConstraints) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is 1
Cbc0014I Cut generator 1 (Probing) - 27 row cuts average 291.4 elements, 1 column cuts (1 active) in 0.753 seconds - new frequency is 1
Cbc0014I Cut generator 2 (Gomory) - 182 row cuts average 1378.5 elements, 0 column cuts (0 active) in 0.191 seconds - new frequency is -100
Cbc0014I Cut generator 3 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is -100
Cbc0014I Cut generator 4 (BKClique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100
Cbc0014I Cut generator 5 (OddHoleWC) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100
Cbc0014I Cut generator 6 (MixedIntegerRounding2) - 186 row cuts average 610.7 elements, 0 column cuts (0 active) in 0.170 seconds - new frequency is 1
Cbc0014I Cut generator 7 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.043 seconds - new frequency is -100
Cbc0014I Cut generator 8 (TwoMirCuts) - 19 row cuts average 284.7 elements, 0 column cuts (0 active) in 0.098 seconds - new frequency is -100
Cbc0014I Cut generator 9 (ZeroHalf) - 2 row cuts average 7226.5 elements, 0 column cuts (0 active) in 0.049 seconds - new frequency is -100
Cbc0014I Cut generator 10 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100
Cbc0010I After 0 nodes, 1 on tree, 5244 best solution, best possible 5044 (8.33 seconds)
Cbc0010I After 11 nodes, 11 on tree, 5244 best solution, best possible 5044 (9.54 seconds)
Cbc0010I After 19 nodes, 15 on tree, 5244 best solution, best possible 5044 (10.63 seconds)
Cbc0010I After 29 nodes, 18 on tree, 5244 best solution, best possible 5044 (11.71 seconds)
Cbc0010I After 38 nodes, 20 on tree, 5244 best solution, best possible 5044 (12.78 seconds)
Cbc0010I After 46 nodes, 22 on tree, 5244 best solution, best possible 5044 (13.81 seconds)
**Cbc0016I Integer solution of 5076 found by strong branching after 4509 iterations and 51 nodes (14.21 seconds)
Cbc0016I Integer solution of 5074 found by strong branching after 4543 iterations and 51 nodes (14.25 seconds)**
Cbc0010I After 58 nodes, 25 on tree, 5074 best solution, best possible 5044 (14.84 seconds)
Cbc0010I After 68 nodes, 30 on tree, 5074 best solution, best possible 5044 (15.85 seconds)
Cbc0010I After 77 nodes, 34 on tree, 5074 best solution, best possible 5044 (16.92 seconds)
Cbc0010I After 88 nodes, 36 on tree, 5074 best solution, best possible 5044 (17.93 seconds)
Cbc0010I After 102 nodes, 42 on tree, 5074 best solution, best possible 5044 (19.01 seconds)
Cbc0010I After 114 nodes, 48 on tree, 5074 best solution, best possible 5044 (20.03 seconds)
Cbc0010I After 128 nodes, 53 on tree, 5074 best solution, best possible 5044 (21.11 seconds)
Cbc0010I After 141 nodes, 56 on tree, 5074 best solution, best possible 5044 (22.21 seconds)
Cbc0010I After 154 nodes, 60 on tree, 5074 best solution, best possible 5044 (23.34 seconds)
Cbc0010I After 167 nodes, 64 on tree, 5074 best solution, best possible 5044 (24.41 seconds)
Cbc0010I After 179 nodes, 71 on tree, 5074 best solution, best possible 5044 (25.49 seconds)
Cbc0010I After 195 nodes, 71 on tree, 5074 best solution, best possible 5044 (26.61 seconds)
Cbc0010I After 210 nodes, 76 on tree, 5074 best solution, best possible 5044 (27.66 seconds)
Cbc0010I After 222 nodes, 79 on tree, 5074 best solution, best possible 5044 (28.70 seconds)
Cbc0010I After 238 nodes, 83 on tree, 5074 best solution, best possible 5044 (29.77 seconds)
Cbc0010I After 252 nodes, 87 on tree, 5074 best solution, best possible 5044 (30.82 seconds)
Cbc0010I After 262 nodes, 92 on tree, 5074 best solution, best possible 5044 (31.85 seconds)
Cbc0010I After 276 nodes, 93 on tree, 5074 best solution, best possible 5044 (32.93 seconds)
Cbc0010I After 286 nodes, 95 on tree, 5074 best solution, best possible 5044 (33.93 seconds)
Cbc0010I After 299 nodes, 99 on tree, 5074 best solution, best possible 5044 (34.94 seconds)
Cbc0010I After 314 nodes, 101 on tree, 5074 best solution, best possible 5044 (36.02 seconds)
Cbc0010I After 325 nodes, 103 on tree, 5074 best solution, best possible 5044 (37.04 seconds)
Cbc0010I After 336 nodes, 106 on tree, 5074 best solution, best possible 5044 (38.16 seconds)
Cbc0010I After 344 nodes, 110 on tree, 5074 best solution, best possible 5044 (39.25 seconds)
Cbc0010I After 353 nodes, 114 on tree, 5074 best solution, best possible 5044 (40.33 seconds)
Cbc0010I After 365 nodes, 117 on tree, 5074 best solution, best possible 5044 (41.36 seconds)
Cbc0010I After 373 nodes, 121 on tree, 5074 best solution, best possible 5044 (42.43 seconds)
Cbc0010I After 386 nodes, 123 on tree, 5074 best solution, best possible 5044 (43.55 seconds)
Cbc0010I After 406 nodes, 126 on tree, 5074 best solution, best possible 5044 (44.62 seconds)
Cbc0010I After 423 nodes, 129 on tree, 5074 best solution, best possible 5044 (45.67 seconds)
Cbc0010I After 435 nodes, 130 on tree, 5074 best solution, best possible 5044 (46.80 seconds)
Cbc0010I After 453 nodes, 131 on tree, 5074 best solution, best possible 5044 (47.84 seconds)
Cbc0010I After 466 nodes, 137 on tree, 5074 best solution, best possible 5044 (48.90 seconds)
Cbc0010I After 484 nodes, 142 on tree, 5074 best solution, best possible 5044 (49.96 seconds)
Cbc0010I After 500 nodes, 145 on tree, 5074 best solution, best possible 5044 (51.04 seconds)
Cbc0010I After 518 nodes, 149 on tree, 5074 best solution, best possible 5044 (52.07 seconds)
Cbc0010I After 537 nodes, 151 on tree, 5074 best solution, best possible 5044 (53.08 seconds)
Cbc0010I After 549 nodes, 155 on tree, 5074 best solution, best possible 5044 (54.16 seconds)
Cbc0010I After 564 nodes, 157 on tree, 5074 best solution, best possible 5044 (55.21 seconds)
Cbc0010I After 576 nodes, 163 on tree, 5074 best solution, best possible 5044 (56.28 seconds)
Cbc0010I After 585 nodes, 166 on tree, 5074 best solution, best possible 5044 (57.32 seconds)
Cbc0010I After 602 nodes, 169 on tree, 5074 best solution, best possible 5044 (58.36 seconds)
Cbc0010I After 614 nodes, 170 on tree, 5074 best solution, best possible 5044 (59.41 seconds)
Cbc0020I Exiting on maximum time
Cbc0005I Partial search - best objective 5074 (best possible 5044), took 40366 iterations and 627 nodes (60.03 seconds)
Cbc0032I Strong branching done 7854 times (43294 iterations), fathomed 29 nodes and fixed 2403 variables
Cbc0035I Maximum depth 32, 64266 variables fixed on reduced cost
Cbc0038I LazyConstraints was tried 555 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.124 seconds)
Cbc0038I Probing was tried 148 times and created 53 cuts of which 0 were active after adding rounds of cuts (1.128 seconds)
Cbc0038I Gomory was tried 10 times and created 182 cuts of which 0 were active after adding rounds of cuts (0.191 seconds)
Cbc0038I Knapsack was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.011 seconds)
Cbc0038I BKClique was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds)
Cbc0038I OddHoleWC was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds)
Cbc0038I MixedIntegerRounding2 was tried 148 times and created 2108 cuts of which 0 were active after adding rounds of cuts (2.013 seconds)
Cbc0038I FlowCover was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.043 seconds)
Cbc0038I TwoMirCuts was tried 10 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.098 seconds)
Cbc0038I ZeroHalf was tried 10 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.049 seconds)
Cbc0038I Clique was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)
Cbc0020I Exiting on maximum time
Cbc0005I Partial search - best objective 5244 (best possible 5044), took 42187 iterations and 677 nodes (60.28 seconds)
Cbc0032I Strong branching done 884 times (3724 iterations), fathomed 7 nodes and fixed 212 variables
Cbc0035I Maximum depth 19, 6 variables fixed on reduced cost
Cuts at root node changed objective from 5044 to 5044
LazyConstraints was tried 53 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.019 seconds)
Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
BKClique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
OddHoleWC was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Result - Stopped on time limit
**Objective value: 100000000000000007629769841091887003294964970946560.00000000
Lower bound: 5044.000
Gap: 19825535289452817607210609730501152828622372864.00**
Enumerated nodes: 677
Total iterations: 42187
Time (CPU seconds): 60.23
Time (Wallclock seconds): 60.46
Total time (CPU seconds): 60.23 (Wallclock seconds): 60.46
Which Python-MIP version and operating system ? Could you share your model ? Perhaps only the .mps file would be enough to debug.
On Wed, 8 Apr 2020 at 07:49, Wit Jakuczun [email protected] wrote:
Turning off lazy constraint generator makes solver working properly.
— You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub https://github.com/coin-or/python-mip/issues/79#issuecomment-610888255, or unsubscribe https://github.com/notifications/unsubscribe-auth/AB4VZOQXP6CHGPJJJKWEJSTRLRJE3ANCNFSM4MDYYK6Q .
--
Haroldo Gambini Santos Computing Department Universidade Federal de Ouro Preto - UFOP email: [email protected] home/research page: www.decom.ufop.br/haroldo
It has long been an axiom of mine that the little things are infinitely the most important. -- Sir Arthur Conan Doyle, "A Case of Identity"
I might be hitting a similar bug. Running a model with a lazy constraint generator. Feasible solution is found only if neither of start solution nor cutoff is used. However, for each of them, log clearly states that integer solutions were found (see outputs below).
Removing the lazy constraint generator seems to fix the start / cutoff issues, however, without it model is incomplete.
Execution without cutoff or start:
Welcome to the CBC MILP Solver Version: Trunk Build Date: May 28 2020
Starting solution of the Linear programming relaxation problem using Primal Simplex
Coin0506I Presolve 358 (-91) rows, 2133 (-875) columns and 4724 (-1920) elements Clp1000I sum of infeasibilities 5.9448e-06 - average 1.66056e-08, 1789 fixed columns Coin0506I Presolve 188 (-170) rows, 218 (-1915) columns and 884 (-3840) elements Clp0029I End of values pass after 218 iterations Clp0014I Perturbing problem by 0.001% of 1.6121358 - largest nonzero change 0 ( 0%) - largest zero change 2.982246e-05 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Coin0511I After Postsolve, objective 301.05693, infeasibilities - dual 0 (0), primal 0 (0) Clp0014I Perturbing problem by 0.001% of 0.86024735 - largest nonzero change 2.5134071e-05 ( 0.0025134071%) - largest zero change 2.9997244e-05 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Coin0511I After Postsolve, objective 301.05693, infeasibilities - dual 0 (0), primal 0 (0) Clp0032I Optimal objective 301.0569325 - 0 iterations time 0.072, Presolve 0.00, Idiot 0.07
Starting MIP optimization Option for timeMode changed from cpu to elapsed Option for preprocess changed from sos to off Option for heuristicsOnOff changed from on to off maxSavedSolutions was changed from 0 to 10 Continuous objective value is 301.057 - 0.00 seconds Coin3009W Conflict graph built in 0.002 seconds, density: 0.054% Cgl0015I Clique Strengthening extended 128 cliques, 160 were dominated After applying Clique Strengthening continuous objective value is 366.29 Cbc0013I At root node, 0 cuts changed objective from 366.28964 to 366.28964 in 1 passes Cbc0014I Cut generator 0 (LazyConstraints) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (OddWheel) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 8 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 9 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0010I After 251 nodes, 52 on tree, 1e+50 best solution, best possible 366.28964 (0.93 seconds) Cbc0010I After 684 nodes, 46 on tree, 1e+50 best solution, best possible 366.28964 (1.93 seconds) Cbc0010I After 1067 nodes, 126 on tree, 1e+50 best solution, best possible 372.41504 (2.93 seconds) Cbc0010I After 1422 nodes, 144 on tree, 1e+50 best solution, best possible 372.41504 (3.94 seconds) Cbc0010I After 1792 nodes, 146 on tree, 1e+50 best solution, best possible 372.41504 (4.94 seconds) Cbc0004I Integer solution of 923.34555 found after 57305 iterations and 1818 nodes (5.12 seconds) Cbc0010I After 2023 nodes, 205 on tree, 923.34555 best solution, best possible 372.41504 (5.94 seconds) Cbc0010I After 2337 nodes, 304 on tree, 923.34555 best solution, best possible 372.41504 (6.94 seconds) Cbc0010I After 2804 nodes, 423 on tree, 923.34555 best solution, best possible 372.41504 (7.94 seconds) Cbc0010I After 3189 nodes, 518 on tree, 923.34555 best solution, best possible 372.41504 (8.94 seconds) Cbc0010I After 3596 nodes, 616 on tree, 923.34555 best solution, best possible 372.41504 (9.95 seconds) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 923.34555 (best possible 372.41504), took 126992 iterations and 3617 nodes (10.00 seconds) Cbc0032I Strong branching done 4884 times (39010 iterations), fathomed 80 nodes and fixed 215 variables Cbc0035I Maximum depth 107, 1540 variables fixed on reduced cost Cuts at root node changed objective from 366.29 to 366.29 LazyConstraints was tried 2480 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.343 seconds) Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) OddWheel was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Result - Stopped on time limit
Objective value: 923.34555061 Lower bound: 372.415 Gap: 1.48 Enumerated nodes: 3617 Total iterations: 126992 Time (CPU seconds): 9.89 Time (Wallclock seconds): 10.04
Total time (CPU seconds): 9.89 (Wallclock seconds): 10.04
Execution with cutoff:
Welcome to the CBC MILP Solver Version: Trunk Build Date: May 28 2020
Starting solution of the Linear programming relaxation problem using Primal Simplex
Coin0506I Presolve 358 (-91) rows, 2133 (-875) columns and 4724 (-1920) elements Clp1000I sum of infeasibilities 5.9448e-06 - average 1.66056e-08, 1789 fixed columns Coin0506I Presolve 188 (-170) rows, 218 (-1915) columns and 884 (-3840) elements Clp0029I End of values pass after 218 iterations Clp0014I Perturbing problem by 0.001% of 1.6121358 - largest nonzero change 0 ( 0%) - largest zero change 2.982246e-05 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Coin0511I After Postsolve, objective 301.05693, infeasibilities - dual 0 (0), primal 0 (0) Clp0014I Perturbing problem by 0.001% of 0.86024735 - largest nonzero change 2.5134071e-05 ( 0.0025134071%) - largest zero change 2.9997244e-05 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Coin0511I After Postsolve, objective 301.05693, infeasibilities - dual 0 (0), primal 0 (0) Clp0032I Optimal objective 301.0569325 - 0 iterations time 0.072, Presolve 0.00, Idiot 0.07
Starting MIP optimization Option for timeMode changed from cpu to elapsed Option for preprocess changed from sos to off Option for heuristicsOnOff changed from on to off maxSavedSolutions was changed from 0 to 10 Continuous objective value is 301.057 - 0.00 seconds Coin3009W Conflict graph built in 0.002 seconds, density: 0.054% Cgl0015I Clique Strengthening extended 128 cliques, 160 were dominated After applying Clique Strengthening continuous objective value is 366.29 Cbc0013I At root node, 0 cuts changed objective from 366.28964 to 366.28964 in 1 passes Cbc0014I Cut generator 0 (LazyConstraints) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (OddWheel) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 8 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 9 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0038I Full problem 417 rows 3008 columns, reduced to 239 rows 1714 columns Cbc0044I Reduced cost fixing - 239 rows, 1714 columns - restarting search Cbc0038I Initial state - 123 integers unsatisfied sum - 35.0964 Cbc0038I Pass 1: suminf. 27.92519 (93) obj. 435.738 iterations 108 Cbc0038I Pass 2: suminf. 20.39297 (63) obj. 557.613 iterations 87 Cbc0038I Pass 3: suminf. 13.88589 (49) obj. 634.205 iterations 65 Cbc0038I Pass 4: suminf. 14.07167 (49) obj. 631.743 iterations 34 Cbc0038I Pass 5: suminf. 13.22838 (46) obj. 646.057 iterations 40 Cbc0038I Pass 6: suminf. 13.38016 (48) obj. 651.338 iterations 11 Cbc0038I Pass 7: suminf. 13.66134 (46) obj. 660.05 iterations 35 Cbc0038I Pass 8: suminf. 13.25431 (47) obj. 672.61 iterations 21 Cbc0038I Pass 9: suminf. 12.45814 (47) obj. 690.06 iterations 25 Cbc0038I Pass 10: suminf. 11.63184 (42) obj. 697.52 iterations 74 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1526 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.59 seconds) Cbc0038I After 0.59 seconds - Feasibility pump exiting - took 0.07 seconds Cbc0031I 88 added rows had average density of 38.693182 Cbc0013I At root node, 88 cuts changed objective from 366.28964 to 535.10303 in 20 passes Cbc0014I Cut generator 0 (LazyConstraints) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Probing) - 633 row cuts average 3.3 elements, 312 column cuts (312 active) in 0.105 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Gomory) - 55 row cuts average 208.7 elements, 0 column cuts (0 active) in 0.085 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Knapsack) - 26 row cuts average 7.4 elements, 0 column cuts (0 active) in 0.047 seconds - new frequency is 1 Cbc0014I Cut generator 4 (Clique) - 2 row cuts average 8.5 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 Cbc0014I Cut generator 5 (OddWheel) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 Cbc0014I Cut generator 6 (MixedIntegerRounding2) - 9 row cuts average 56.0 elements, 0 column cuts (0 active) in 0.015 seconds - new frequency is 1 Cbc0014I Cut generator 7 (FlowCover) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cbc0014I Cut generator 8 (TwoMirCuts) - 128 row cuts average 95.1 elements, 0 column cuts (0 active) in 0.023 seconds - new frequency is 1 Cbc0014I Cut generator 9 (ZeroHalf) - 105 row cuts average 22.8 elements, 0 column cuts (0 active) in 0.053 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 535.10303 (1.26 seconds) Cbc0010I After 31 nodes, 22 on tree, 1e+50 best solution, best possible 535.10303 (2.27 seconds) Cbc0004I Integer solution of 691.05359 found after 3111 iterations and 34 nodes (2.32 seconds) Cbc0010I After 77 nodes, 39 on tree, 691.05359 best solution, best possible 535.10303 (3.28 seconds) Cbc0004I Integer solution of 630.69003 found after 9134 iterations and 110 nodes (3.77 seconds) Cbc0010I After 136 nodes, 62 on tree, 630.69003 best solution, best possible 535.10303 (4.29 seconds) Cbc0010I After 211 nodes, 100 on tree, 630.69003 best solution, best possible 535.10303 (5.29 seconds) Cbc0010I After 285 nodes, 133 on tree, 630.69003 best solution, best possible 535.10303 (6.29 seconds) Cbc0004I Integer solution of 601.91147 found after 27459 iterations and 343 nodes (6.84 seconds) Cbc0004I Integer solution of 589.71261 found after 28902 iterations and 363 nodes (7.09 seconds) Cbc0010I After 386 nodes, 95 on tree, 589.71261 best solution, best possible 535.10303 (7.30 seconds) Cbc0004I Integer solution of 580.50944 found after 35317 iterations and 452 nodes (8.16 seconds) Cbc0010I After 464 nodes, 89 on tree, 580.50944 best solution, best possible 535.10303 (8.30 seconds) Cbc0010I After 576 nodes, 113 on tree, 580.50944 best solution, best possible 535.10303 (9.31 seconds) Cbc0004I Integer solution of 579.63564 found after 44933 iterations and 607 nodes (9.52 seconds) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 579.63564 (best possible 535.10303), took 48434 iterations and 661 nodes (10.01 seconds) Cbc0032I Strong branching done 1352 times (42137 iterations), fathomed 3 nodes and fixed 59 variables Cbc0035I Maximum depth 36, 36728 variables fixed on reduced cost Cbc0038I LazyConstraints was tried 639 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.237 seconds) Cbc0038I Probing was tried 633 times and created 13276 cuts of which 0 were active after adding rounds of cuts (0.466 seconds) Cbc0038I Gomory was tried 611 times and created 172 cuts of which 0 were active after adding rounds of cuts (0.393 seconds) Cbc0038I Knapsack was tried 611 times and created 1501 cuts of which 0 were active after adding rounds of cuts (0.999 seconds) Cbc0038I Clique was tried 20 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) Cbc0038I OddWheel was tried 20 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) Cbc0038I MixedIntegerRounding2 was tried 610 times and created 322 cuts of which 0 were active after adding rounds of cuts (0.174 seconds) Cbc0038I FlowCover was tried 20 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Cbc0038I TwoMirCuts was tried 610 times and created 1585 cuts of which 0 were active after adding rounds of cuts (0.166 seconds) Cbc0038I ZeroHalf was tried 610 times and created 3240 cuts of which 0 were active after adding rounds of cuts (1.117 seconds) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible 366.28964), took 49704 iterations and 711 nodes (10.02 seconds) Cbc0032I Strong branching done 344 times (3116 iterations), fathomed 1 nodes and fixed 3 variables Cbc0035I Maximum depth 30, 3 variables fixed on reduced cost Cuts at root node changed objective from 366.29 to 366.29 LazyConstraints was tried 42 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.015 seconds) Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) OddWheel was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Result - Stopped on time limit
No feasible solution found Lower bound: 366.290 Enumerated nodes: 711 Total iterations: 49704 Time (CPU seconds): 9.88 Time (Wallclock seconds): 10.02
Total time (CPU seconds): 9.88 (Wallclock seconds): 10.02
Execution with cutoff and without lazy_consts_generator:
Welcome to the CBC MILP Solver Version: Trunk Build Date: May 28 2020
Starting solution of the Linear programming relaxation problem using Primal Simplex
Coin0506I Presolve 358 (-91) rows, 2133 (-875) columns and 4724 (-1920) elements Clp1000I sum of infeasibilities 5.9448e-06 - average 1.66056e-08, 1789 fixed columns Coin0506I Presolve 188 (-170) rows, 218 (-1915) columns and 884 (-3840) elements Clp0029I End of values pass after 218 iterations Clp0014I Perturbing problem by 0.001% of 1.6121358 - largest nonzero change 0 ( 0%) - largest zero change 2.982246e-05 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Coin0511I After Postsolve, objective 301.05693, infeasibilities - dual 0 (0), primal 0 (0) Clp0014I Perturbing problem by 0.001% of 0.86024735 - largest nonzero change 2.5134071e-05 ( 0.0025134071%) - largest zero change 2.9997244e-05 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Coin0511I After Postsolve, objective 301.05693, infeasibilities - dual 0 (0), primal 0 (0) Clp0032I Optimal objective 301.0569325 - 0 iterations time 0.072, Presolve 0.00, Idiot 0.07
Starting MIP optimization Option for timeMode changed from cpu to elapsed maxSavedSolutions was changed from 0 to 10 Continuous objective value is 301.057 - 0.00 seconds Cgl0003I 350 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 63 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 70 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 55 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 51 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 48 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 39 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 26 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 21 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions Cgl0004I processed model has 353 rows, 2114 columns (2114 integer (1942 of which binary)) and 5227 elements Coin3009W Conflict graph built in 0.001 seconds, density: 0.039% Cgl0015I Clique Strengthening extended 0 cliques, 0 were dominated Cbc0038I Initial state - 124 integers unsatisfied sum - 34.4859 Cbc0038I Pass 1: suminf. 20.85911 (60) obj. 591.143 iterations 242 Cbc0038I Pass 2: suminf. 19.87166 (57) obj. 590.713 iterations 43 Cbc0038I Pass 3: suminf. 17.72321 (52) obj. 600.457 iterations 75 Cbc0038I Pass 4: suminf. 17.53360 (53) obj. 607.255 iterations 44 Cbc0038I Pass 5: suminf. 17.30378 (52) obj. 607.255 iterations 11 Cbc0038I Pass 6: suminf. 17.30378 (52) obj. 607.255 iterations 4 Cbc0038I Pass 7: suminf. 21.22650 (77) obj. 697.52 iterations 160 Cbc0038I Pass 8: suminf. 13.16268 (58) obj. 697.52 iterations 247 Cbc0038I Pass 9: suminf. 13.11697 (51) obj. 697.52 iterations 81 Cbc0038I Pass 10: suminf. 10.95267 (46) obj. 697.52 iterations 57 Cbc0038I Pass 11: suminf. 14.10091 (49) obj. 697.52 iterations 126 Cbc0038I Pass 12: suminf. 14.11554 (46) obj. 697.52 iterations 40 Cbc0038I Pass 13: suminf. 13.52573 (50) obj. 697.52 iterations 73 Cbc0038I Pass 14: suminf. 11.62356 (42) obj. 697.52 iterations 78 Cbc0038I Pass 15: suminf. 11.62356 (42) obj. 697.52 iterations 0 Cbc0038I Pass 16: suminf. 9.78816 (42) obj. 697.52 iterations 87 Cbc0038I Pass 17: suminf. 9.91278 (41) obj. 697.52 iterations 49 Cbc0038I Pass 18: suminf. 9.71992 (43) obj. 697.52 iterations 27 Cbc0038I Pass 19: suminf. 10.98040 (44) obj. 697.52 iterations 101 Cbc0038I Pass 20: suminf. 9.87164 (43) obj. 697.52 iterations 92 Cbc0038I Pass 21: suminf. 10.09433 (36) obj. 697.52 iterations 45 Cbc0038I Pass 22: suminf. 10.51398 (36) obj. 697.52 iterations 58 Cbc0038I Pass 23: suminf. 9.00269 (39) obj. 697.52 iterations 84 Cbc0038I Pass 24: suminf. 11.06416 (42) obj. 697.52 iterations 81 Cbc0038I Pass 25: suminf. 9.17842 (36) obj. 697.52 iterations 30 Cbc0038I Pass 26: suminf. 8.79363 (30) obj. 694.408 iterations 59 Cbc0038I Pass 27: suminf. 9.61664 (32) obj. 697.52 iterations 98 Cbc0038I Pass 28: suminf. 7.65033 (31) obj. 697.52 iterations 54 Cbc0038I Pass 29: suminf. 8.05714 (29) obj. 697.52 iterations 68 Cbc0038I Pass 30: suminf. 7.01530 (28) obj. 697.52 iterations 23 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1844 integers at bound fixed and 0 continuous Cbc0038I Full problem 353 rows 2114 columns, reduced to 113 rows 175 columns Cbc0038I Mini branch and bound did not improve solution (0.64 seconds) Cbc0038I After 0.64 seconds - Feasibility pump exiting - took 0.17 seconds Cbc0031I 102 added rows had average density of 27.882353 Cbc0013I At root node, 102 cuts changed objective from 422.81217 to 541.61408 in 16 passes Cbc0014I Cut generator 0 (Probing) - 580 row cuts average 2.2 elements, 83 column cuts (83 active) in 0.152 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 129 row cuts average 398.6 elements, 0 column cuts (0 active) in 0.069 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 20 row cuts average 7.6 elements, 0 column cuts (0 active) in 0.042 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Clique) - 2 row cuts average 4.5 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 Cbc0014I Cut generator 4 (OddWheel) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100 Cbc0014I Cut generator 5 (MixedIntegerRounding2) - 2 row cuts average 86.0 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is -100 Cbc0014I Cut generator 6 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 Cbc0014I Cut generator 7 (TwoMirCuts) - 173 row cuts average 138.8 elements, 0 column cuts (0 active) in 0.029 seconds - new frequency is 1 Cbc0014I Cut generator 8 (ZeroHalf) - 141 row cuts average 28.4 elements, 0 column cuts (0 active) in 0.046 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 541.61408 (1.32 seconds) Cbc0016I Integer solution of 607.18504 found by strong branching after 3811 iterations and 19 nodes (2.09 seconds) Cbc0004I Integer solution of 601.31589 found after 3858 iterations and 20 nodes (2.09 seconds) Cbc0038I Full problem 353 rows 2114 columns, reduced to 54 rows 66 columns Cbc0012I Integer solution of 584.51863 found by RINS after 4059 iterations and 21 nodes (2.19 seconds) Cbc0010I After 29 nodes, 12 on tree, 584.51863 best solution, best possible 541.61408 (2.33 seconds) Cbc0004I Integer solution of 583.2665 found after 5299 iterations and 33 nodes (2.36 seconds) Cbc0012I Integer solution of 579.63564 found by DiveCoefficient after 5649 iterations and 37 nodes (2.44 seconds) Cbc0038I Full problem 353 rows 2114 columns, reduced to 63 rows 83 columns Cbc0038I Full problem 455 rows 2114 columns, reduced to 269 rows 1537 columns Cbc0044I Reduced cost fixing - 269 rows, 1537 columns - restarting search Cbc0012I Integer solution of 579.63564 found by Previous solution after 0 iterations and 0 nodes (2.75 seconds) Cbc0038I Full problem 269 rows 1537 columns, reduced to 0 rows 0 columns Cbc0031I 67 added rows had average density of 39.522388 Cbc0013I At root node, 67 cuts changed objective from 443.75621 to 541.8993 in 10 passes Cbc0014I Cut generator 0 (Probing) - 374 row cuts average 2.8 elements, 352 column cuts (352 active) in 0.050 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 47 row cuts average 138.1 elements, 0 column cuts (0 active) in 0.047 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 27 row cuts average 4.9 elements, 0 column cuts (0 active) in 0.019 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Clique) - 5 row cuts average 9.6 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (OddWheel) - 1 row cuts average 12.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 Cbc0014I Cut generator 5 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 Cbc0014I Cut generator 6 (FlowCover) - 3 row cuts average 3.3 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100 Cbc0014I Cut generator 7 (TwoMirCuts) - 124 row cuts average 62.8 elements, 0 column cuts (0 active) in 0.019 seconds - new frequency is 1 Cbc0014I Cut generator 8 (ZeroHalf) - 69 row cuts average 16.0 elements, 0 column cuts (0 active) in 0.023 seconds - new frequency is 1 Cbc0014I Cut generator 10 (Stored from first) - 95 row cuts average 27.0 elements, 0 column cuts (0 active) Cbc0010I After 0 nodes, 1 on tree, 579.63564 best solution, best possible 541.8993 (3.20 seconds) Cbc0010I After 34 nodes, 18 on tree, 579.63564 best solution, best possible 541.8993 (4.21 seconds) Cbc0038I Full problem 269 rows 1537 columns, reduced to 45 rows 72 columns Cbc0038I Full problem 269 rows 1537 columns, reduced to 69 rows 86 columns Cbc0010I After 112 nodes, 20 on tree, 579.63564 best solution, best possible 541.8993 (5.22 seconds) Cbc0038I Full problem 269 rows 1537 columns, reduced to 64 rows 102 columns Cbc0010I After 203 nodes, 25 on tree, 579.63564 best solution, best possible 541.8993 (6.22 seconds) Cbc0010I After 288 nodes, 30 on tree, 579.63564 best solution, best possible 541.8993 (7.23 seconds) Cbc0038I Full problem 269 rows 1537 columns, reduced to 63 rows 98 columns Cbc0010I After 381 nodes, 41 on tree, 579.63564 best solution, best possible 541.8993 (8.24 seconds) Cbc0038I Full problem 269 rows 1537 columns, reduced to 83 rows 113 columns Cbc0010I After 467 nodes, 46 on tree, 579.63564 best solution, best possible 541.8993 (9.25 seconds) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 579.63564 (best possible 541.8993), took 43339 iterations and 560 nodes (10.00 seconds) Cbc0032I Strong branching done 1490 times (49505 iterations), fathomed 11 nodes and fixed 214 variables Cbc0035I Maximum depth 31, 28877 variables fixed on reduced cost Cbc0038I Probing was tried 471 times and created 11440 cuts of which 0 were active after adding rounds of cuts (0.308 seconds) Cbc0038I Gomory was tried 374 times and created 94 cuts of which 0 were active after adding rounds of cuts (0.284 seconds) Cbc0038I Knapsack was tried 374 times and created 1375 cuts of which 0 were active after adding rounds of cuts (0.517 seconds) Cbc0038I Clique was tried 10 times and created 5 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) Cbc0038I OddWheel was tried 10 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) Cbc0038I MixedIntegerRounding2 was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) Cbc0038I FlowCover was tried 10 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) Cbc0038I TwoMirCuts was tried 374 times and created 908 cuts of which 0 were active after adding rounds of cuts (0.104 seconds) Cbc0038I ZeroHalf was tried 374 times and created 1965 cuts of which 0 were active after adding rounds of cuts (0.704 seconds) Cbc0038I Stored from first was tried 374 times and created 894 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 579.63564 (best possible 541.61408), took 50056 iterations and 610 nodes (10.00 seconds) Cbc0032I Strong branching done 324 times (3614 iterations), fathomed 1 nodes and fixed 1 variables Cbc0035I Maximum depth 17, 7406 variables fixed on reduced cost Cuts at root node changed objective from 422.812 to 541.614 Probing was tried 111 times and created 2058 cuts of which 0 were active after adding rounds of cuts (0.209 seconds) Gomory was tried 107 times and created 133 cuts of which 0 were active after adding rounds of cuts (0.127 seconds) Knapsack was tried 107 times and created 167 cuts of which 0 were active after adding rounds of cuts (0.199 seconds) Clique was tried 16 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) OddWheel was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) MixedIntegerRounding2 was tried 16 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.011 seconds) FlowCover was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) TwoMirCuts was tried 107 times and created 300 cuts of which 0 were active after adding rounds of cuts (0.068 seconds) ZeroHalf was tried 107 times and created 448 cuts of which 0 were active after adding rounds of cuts (0.197 seconds) ImplicationCuts was tried 38 times and created 74 cuts of which 0 were active after adding rounds of cuts (0.015 seconds)
Result - Stopped on time limit
Objective value: 579.63563506 Lower bound: 541.614 Gap: 0.07 Enumerated nodes: 610 Total iterations: 50056 Time (CPU seconds): 9.96 Time (Wallclock seconds): 10.06
Total time (CPU seconds): 9.96 (Wallclock seconds): 10.06
Execution with start:
Welcome to the CBC MILP Solver Version: Trunk Build Date: May 28 2020
Starting solution of the Linear programming relaxation problem using Primal Simplex
Coin0506I Presolve 358 (-91) rows, 2133 (-875) columns and 4724 (-1920) elements Clp1000I sum of infeasibilities 5.9448e-06 - average 1.66056e-08, 1789 fixed columns Coin0506I Presolve 188 (-170) rows, 218 (-1915) columns and 884 (-3840) elements Clp0029I End of values pass after 218 iterations Clp0014I Perturbing problem by 0.001% of 1.6121358 - largest nonzero change 0 ( 0%) - largest zero change 2.982246e-05 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Coin0511I After Postsolve, objective 301.05693, infeasibilities - dual 0 (0), primal 0 (0) Clp0014I Perturbing problem by 0.001% of 0.86024735 - largest nonzero change 2.5134071e-05 ( 0.0025134071%) - largest zero change 2.9997244e-05 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Coin0511I After Postsolve, objective 301.05693, infeasibilities - dual 0 (0), primal 0 (0) Clp0032I Optimal objective 301.0569325 - 0 iterations time 0.072, Presolve 0.00, Idiot 0.07
Starting MIP optimization Option for timeMode changed from cpu to elapsed Option for preprocess changed from sos to off Option for heuristicsOnOff changed from on to off maxSavedSolutions was changed from 0 to 10 Continuous objective value is 301.057 - 0.00 seconds Coin3009W Conflict graph built in 0.002 seconds, density: 0.054% Cgl0015I Clique Strengthening extended 128 cliques, 160 were dominated After applying Clique Strengthening continuous objective value is 366.29 Cbc0045I MIPStart provided solution with cost 697.519 Cbc0012I Integer solution of 697.51858 found by Reduced search after 0 iterations and 0 nodes (0.07 seconds) Cbc0013I At root node, 0 cuts changed objective from 366.28964 to 366.28964 in 1 passes Cbc0014I Cut generator 0 (LazyConstraints) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (OddWheel) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 8 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 9 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0038I Full problem 417 rows 3008 columns, reduced to 239 rows 1714 columns Cbc0044I Reduced cost fixing - 239 rows, 1714 columns - restarting search Cbc0038I Unable to insert previous solution - using cutoff of 697.519 Cbc0038I Initial state - 123 integers unsatisfied sum - 35.0964 Cbc0038I Pass 1: suminf. 27.92519 (93) obj. 435.738 iterations 108 Cbc0038I Pass 2: suminf. 20.39297 (63) obj. 557.613 iterations 87 Cbc0038I Pass 3: suminf. 13.88589 (49) obj. 634.205 iterations 65 Cbc0038I Pass 4: suminf. 14.07167 (49) obj. 631.743 iterations 34 Cbc0038I Pass 5: suminf. 13.22838 (46) obj. 646.057 iterations 40 Cbc0038I Pass 6: suminf. 13.38016 (48) obj. 651.338 iterations 11 Cbc0038I Pass 7: suminf. 13.66134 (46) obj. 660.05 iterations 35 Cbc0038I Pass 8: suminf. 13.25431 (47) obj. 672.61 iterations 21 Cbc0038I Pass 9: suminf. 12.45814 (47) obj. 690.06 iterations 25 Cbc0038I Pass 10: suminf. 11.63191 (42) obj. 697.519 iterations 74 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1526 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.57 seconds) Cbc0038I After 0.58 seconds - Feasibility pump exiting - took 0.07 seconds Cbc0031I 88 added rows had average density of 38.693182 Cbc0013I At root node, 88 cuts changed objective from 366.28964 to 535.10303 in 20 passes Cbc0014I Cut generator 0 (LazyConstraints) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Probing) - 633 row cuts average 3.3 elements, 312 column cuts (312 active) in 0.106 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Gomory) - 55 row cuts average 208.7 elements, 0 column cuts (0 active) in 0.080 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Knapsack) - 26 row cuts average 7.4 elements, 0 column cuts (0 active) in 0.044 seconds - new frequency is 1 Cbc0014I Cut generator 4 (Clique) - 2 row cuts average 8.5 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 Cbc0014I Cut generator 5 (OddWheel) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 Cbc0014I Cut generator 6 (MixedIntegerRounding2) - 9 row cuts average 56.0 elements, 0 column cuts (0 active) in 0.015 seconds - new frequency is 1 Cbc0014I Cut generator 7 (FlowCover) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cbc0014I Cut generator 8 (TwoMirCuts) - 128 row cuts average 95.1 elements, 0 column cuts (0 active) in 0.022 seconds - new frequency is 1 Cbc0014I Cut generator 9 (ZeroHalf) - 105 row cuts average 22.8 elements, 0 column cuts (0 active) in 0.055 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 535.10303 (1.25 seconds) Cbc0010I After 32 nodes, 21 on tree, 1e+50 best solution, best possible 535.10303 (2.25 seconds) Cbc0004I Integer solution of 691.05359 found after 3111 iterations and 34 nodes (2.30 seconds) Cbc0010I After 83 nodes, 42 on tree, 691.05359 best solution, best possible 535.10303 (3.27 seconds) Cbc0004I Integer solution of 630.69003 found after 9134 iterations and 110 nodes (3.63 seconds) Cbc0010I After 146 nodes, 66 on tree, 630.69003 best solution, best possible 535.10303 (4.28 seconds) Cbc0010I After 230 nodes, 107 on tree, 630.69003 best solution, best possible 535.10303 (5.28 seconds) Cbc0010I After 326 nodes, 153 on tree, 630.69003 best solution, best possible 535.10303 (6.29 seconds) Cbc0004I Integer solution of 601.91147 found after 27459 iterations and 343 nodes (6.45 seconds) Cbc0004I Integer solution of 589.71261 found after 28902 iterations and 363 nodes (6.64 seconds) Cbc0010I After 423 nodes, 111 on tree, 589.71261 best solution, best possible 535.10303 (7.29 seconds) Cbc0004I Integer solution of 580.50944 found after 35317 iterations and 452 nodes (7.60 seconds) Cbc0010I After 520 nodes, 103 on tree, 580.50944 best solution, best possible 535.10303 (8.30 seconds) Cbc0004I Integer solution of 579.63564 found after 44933 iterations and 607 nodes (8.92 seconds) Cbc0010I After 648 nodes, 122 on tree, 579.63564 best solution, best possible 535.10303 (9.31 seconds) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 579.63564 (best possible 535.10303), took 52409 iterations and 736 nodes (10.00 seconds) Cbc0032I Strong branching done 1424 times (44070 iterations), fathomed 3 nodes and fixed 83 variables Cbc0035I Maximum depth 36, 42397 variables fixed on reduced cost Cbc0038I LazyConstraints was tried 694 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.242 seconds) Cbc0038I Probing was tried 688 times and created 14438 cuts of which 0 were active after adding rounds of cuts (0.467 seconds) Cbc0038I Gomory was tried 658 times and created 175 cuts of which 0 were active after adding rounds of cuts (0.395 seconds) Cbc0038I Knapsack was tried 658 times and created 1651 cuts of which 0 were active after adding rounds of cuts (1.004 seconds) Cbc0038I Clique was tried 20 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) Cbc0038I OddWheel was tried 20 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) Cbc0038I MixedIntegerRounding2 was tried 658 times and created 339 cuts of which 0 were active after adding rounds of cuts (0.170 seconds) Cbc0038I FlowCover was tried 20 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Cbc0038I TwoMirCuts was tried 658 times and created 1671 cuts of which 0 were active after adding rounds of cuts (0.165 seconds) Cbc0038I ZeroHalf was tried 658 times and created 3498 cuts of which 0 were active after adding rounds of cuts (1.122 seconds) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 697.51858 (best possible 366.28964), took 53679 iterations and 786 nodes (10.01 seconds) Cbc0032I Strong branching done 344 times (3116 iterations), fathomed 1 nodes and fixed 3 variables Cbc0035I Maximum depth 30, 3 variables fixed on reduced cost Cuts at root node changed objective from 366.29 to 366.29 LazyConstraints was tried 43 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.011 seconds) Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) OddWheel was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Result - Stopped on time limit
Objective value: 100000000000000007629769841091887003294964970946560.00000000 Lower bound: 366.290 Gap: 273007991880410413826604782108867707284960051200.00 Enumerated nodes: 786 Total iterations: 53679 Time (CPU seconds): 9.91 Time (Wallclock seconds): 10.02
Total time (CPU seconds): 9.91 (Wallclock seconds): 10.02
Execution with start and without lazy_consts_generator:
Welcome to the CBC MILP Solver Version: Trunk Build Date: May 28 2020
Starting solution of the Linear programming relaxation problem using Primal Simplex
Coin0506I Presolve 358 (-91) rows, 2133 (-875) columns and 4724 (-1920) elements Clp1000I sum of infeasibilities 5.9448e-06 - average 1.66056e-08, 1789 fixed columns Coin0506I Presolve 188 (-170) rows, 218 (-1915) columns and 884 (-3840) elements Clp0029I End of values pass after 218 iterations Clp0014I Perturbing problem by 0.001% of 1.6121358 - largest nonzero change 0 ( 0%) - largest zero change 2.982246e-05 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Coin0511I After Postsolve, objective 301.05693, infeasibilities - dual 0 (0), primal 0 (0) Clp0014I Perturbing problem by 0.001% of 0.86024735 - largest nonzero change 2.5134071e-05 ( 0.0025134071%) - largest zero change 2.9997244e-05 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Clp0000I Optimal - objective value 301.05693 Coin0511I After Postsolve, objective 301.05693, infeasibilities - dual 0 (0), primal 0 (0) Clp0032I Optimal objective 301.0569325 - 0 iterations time 0.072, Presolve 0.00, Idiot 0.07
Starting MIP optimization Option for timeMode changed from cpu to elapsed maxSavedSolutions was changed from 0 to 10 Continuous objective value is 301.057 - 0.00 seconds Cgl0003I 350 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 52 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 65 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 63 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 59 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 29 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 27 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 21 strengthened rows, 0 substitutions Cgl0004I processed model has 354 rows, 2114 columns (2114 integer (1942 of which binary)) and 5233 elements Coin3009W Conflict graph built in 0.001 seconds, density: 0.038% Cgl0015I Clique Strengthening extended 0 cliques, 0 were dominated Cbc0045I MIPStart solution provided values for 24 of 2114 integer variables, 4 variables are still fractional. Cbc0038I Full problem 354 rows 2114 columns, reduced to 0 rows 0 columns Cbc0045I Mini branch and bound defined values for remaining variables in 0.07 seconds. Cbc0045I MIPStart provided solution with cost 62 Cbc0012I Integer solution of 697.51858 found by Reduced search after 0 iterations and 0 nodes (0.53 seconds) Cbc0038I Full problem 354 rows 2114 columns, reduced to 0 rows 0 columns Cbc0031I 91 added rows had average density of 35.505495 Cbc0013I At root node, 91 cuts changed objective from 419.75097 to 540.40665 in 16 passes Cbc0014I Cut generator 0 (Probing) - 504 row cuts average 2.3 elements, 154 column cuts (154 active) in 0.137 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 75 row cuts average 376.9 elements, 0 column cuts (0 active) in 0.069 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 17 row cuts average 7.0 elements, 0 column cuts (0 active) in 0.042 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Clique) - 2 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 Cbc0014I Cut generator 4 (OddWheel) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100 Cbc0014I Cut generator 5 (MixedIntegerRounding2) - 1 row cuts average 16.0 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is -100 Cbc0014I Cut generator 6 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 Cbc0014I Cut generator 7 (TwoMirCuts) - 131 row cuts average 122.5 elements, 0 column cuts (0 active) in 0.027 seconds - new frequency is 1 Cbc0014I Cut generator 8 (ZeroHalf) - 101 row cuts average 25.5 elements, 0 column cuts (0 active) in 0.044 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 697.51858 best solution, best possible 540.40665 (1.23 seconds) Cbc0010I After 29 nodes, 21 on tree, 697.51858 best solution, best possible 540.40665 (2.24 seconds) Cbc0038I Full problem 354 rows 2114 columns, reduced to 67 rows 91 columns Cbc0038I Full problem 445 rows 2114 columns, reduced to 285 rows 1780 columns Cbc0044I Reduced cost fixing - 285 rows, 1780 columns - restarting search Cbc0012I Integer solution of 697.51858 found by Previous solution after 0 iterations and 0 nodes (2.68 seconds) Cbc0031I 82 added rows had average density of 47.865854 Cbc0013I At root node, 82 cuts changed objective from 437.18768 to 540.61959 in 9 passes Cbc0014I Cut generator 0 (Probing) - 462 row cuts average 2.2 elements, 0 column cuts (0 active) in 0.068 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 46 row cuts average 152.3 elements, 0 column cuts (0 active) in 0.035 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 15 row cuts average 7.5 elements, 0 column cuts (0 active) in 0.022 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Clique) - 2 row cuts average 10.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (OddWheel) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 Cbc0014I Cut generator 5 (MixedIntegerRounding2) - 6 row cuts average 127.7 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is -100 Cbc0014I Cut generator 6 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 Cbc0014I Cut generator 7 (TwoMirCuts) - 91 row cuts average 79.8 elements, 0 column cuts (0 active) in 0.023 seconds - new frequency is 1 Cbc0014I Cut generator 8 (ZeroHalf) - 86 row cuts average 22.1 elements, 0 column cuts (0 active) in 0.020 seconds - new frequency is 1 Cbc0014I Cut generator 10 (Stored from first) - 104 row cuts average 35.7 elements, 0 column cuts (0 active) Cbc0010I After 0 nodes, 1 on tree, 697.51858 best solution, best possible 540.61959 (3.17 seconds) Cbc0004I Integer solution of 583.2665 found after 2133 iterations and 15 nodes (4.02 seconds) Cbc0010I After 30 nodes, 10 on tree, 583.2665 best solution, best possible 540.61959 (4.19 seconds) Cbc0038I Full problem 285 rows 1780 columns, reduced to 57 rows 86 columns Cbc0038I Full problem 285 rows 1780 columns, reduced to 54 rows 79 columns Cbc0010I After 105 nodes, 10 on tree, 583.2665 best solution, best possible 540.61959 (5.21 seconds) Cbc0010I After 177 nodes, 14 on tree, 583.2665 best solution, best possible 540.61959 (6.23 seconds) Cbc0038I Full problem 285 rows 1780 columns, reduced to 65 rows 89 columns Cbc0010I After 265 nodes, 17 on tree, 583.2665 best solution, best possible 540.61959 (7.23 seconds) Cbc0038I Full problem 285 rows 1780 columns, reduced to 80 rows 114 columns Cbc0010I After 350 nodes, 15 on tree, 583.2665 best solution, best possible 540.61959 (8.24 seconds) Cbc0038I Full problem 285 rows 1780 columns, reduced to 81 rows 120 columns Cbc0010I After 428 nodes, 8 on tree, 583.2665 best solution, best possible 540.61959 (9.24 seconds) Cbc0038I Full problem 285 rows 1780 columns, reduced to 82 rows 113 columns Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 583.2665 (best possible 540.61959), took 36146 iterations and 503 nodes (10.00 seconds) Cbc0032I Strong branching done 1464 times (46910 iterations), fathomed 8 nodes and fixed 209 variables Cbc0035I Maximum depth 42, 28713 variables fixed on reduced cost Cbc0038I Probing was tried 407 times and created 9739 cuts of which 0 were active after adding rounds of cuts (0.290 seconds) Cbc0038I Gomory was tried 321 times and created 77 cuts of which 0 were active after adding rounds of cuts (0.255 seconds) Cbc0038I Knapsack was tried 321 times and created 1103 cuts of which 0 were active after adding rounds of cuts (0.469 seconds) Cbc0038I Clique was tried 9 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) Cbc0038I OddWheel was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) Cbc0038I MixedIntegerRounding2 was tried 9 times and created 6 cuts of which 0 were active after adding rounds of cuts (0.011 seconds) Cbc0038I FlowCover was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) Cbc0038I TwoMirCuts was tried 321 times and created 784 cuts of which 0 were active after adding rounds of cuts (0.104 seconds) Cbc0038I ZeroHalf was tried 321 times and created 1550 cuts of which 0 were active after adding rounds of cuts (0.662 seconds) Cbc0038I Stored from first was tried 321 times and created 563 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Cbc0012I Integer solution of 583.2665 found by Reduced search after 42358 iterations and 553 nodes (10.01 seconds) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 583.2665 (best possible 540.40665), took 42358 iterations and 553 nodes (10.01 seconds) Cbc0032I Strong branching done 404 times (4300 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 25, 191 variables fixed on reduced cost Cuts at root node changed objective from 419.751 to 540.407 Probing was tried 113 times and created 2358 cuts of which 0 were active after adding rounds of cuts (0.199 seconds) Gomory was tried 113 times and created 79 cuts of which 0 were active after adding rounds of cuts (0.127 seconds) Knapsack was tried 113 times and created 216 cuts of which 0 were active after adding rounds of cuts (0.226 seconds) Clique was tried 16 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) OddWheel was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) MixedIntegerRounding2 was tried 16 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.013 seconds) FlowCover was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) TwoMirCuts was tried 113 times and created 355 cuts of which 0 were active after adding rounds of cuts (0.060 seconds) ZeroHalf was tried 113 times and created 575 cuts of which 0 were active after adding rounds of cuts (0.239 seconds) ImplicationCuts was tried 21 times and created 16 cuts of which 0 were active after adding rounds of cuts (0.010 seconds)
Result - Stopped on time limit
Objective value: 583.26649967 Lower bound: 540.407 Gap: 0.08 Enumerated nodes: 553 Total iterations: 42358 Time (CPU seconds): 9.93 Time (Wallclock seconds): 10.04
Total time (CPU seconds): 9.93 (Wallclock seconds): 10.04
Someone @WitJakuczun or @vpranckaitis needs to submit a small/reduced code example for debugging purpose
