--- Job ran12x21 Start 08/21/08 11:48:11
GAMS Rev 227  Copyright (C) 1987-2008 GAMS Development. All rights reserved
Licensee: Stefan Vigerske                                G071106/0001CB-LNX
          Humboldt University Berlin, Numerical Mathematics          DC5918
--- Starting compilation
--- ran12x21.gms(106) 2 Mb
--- GDXin=/home/stefan/work/gams/models/LINlib/ran12x21.gdx
--- ran12x21.gms(148) 3 Mb
--- Starting execution: elapsed 0:00:00.009
--- ran12x21.gms(123) 4 Mb
--- Generating MIP model m
--- ran12x21.gms(124) 4 Mb
---   286 rows  505 columns  1,513 non-zeroes
---   252 discrete-columns
--- Executing COINCBC: elapsed 0:00:00.018

GAMS/CoinCbc 2.0 LP/MIP Solver
written by J. Forrest
Problem statistics: 504 columns and 285 rows.
                    252 variables have integrality restrictions.

Calling CBC main solution routine...
Coin Cbc and Clp Solver version 2.00.00, build Mar 20 2008
command line - GAMS/CBC -solve -quit
Continuous objective value is 3157.38 - 0.01 seconds
processed model has 285 rows, 504 columns (252 integer) and 1008 elements
Pass   1: obj.    2.23721 --> up =     0 , down =     0 -- rand =   11 (  17)  - solution found of 4511
Before mini branch and bound, 228 integers at bound fixed and 227 continuous
Full problem 285 rows 504 columns, reduced to 21 rows 27 columns
Mini branch and bound improved solution from 4511 to 4033 (0.02 seconds)
Round again with cutoff of 3945.44
Pass   2: obj.    2.23721 --> up =     0 , down =     0 -- rand =   11 (  18)
Pass   3: obj.    2.52363 --> up =     0 , down =     3
Pass   4: obj.    0.28725 --> up =     0 , down =     0 -- rand =    3 (  18)  perturbation applied
Pass   5: obj.   38.44624 --> up =     0 , down =    38
Pass   6: obj.    1.48164 --> up =     1 , down =     0
Pass   7: obj.    1.28317 --> up =     0 , down =     0 -- rand =    7 (  13)
Pass   8: obj.    5.52447 --> up =     2 , down =     5 perturbation applied
Pass   9: obj.   33.72162 --> up =     2 , down =    31
Pass  10: obj.    1.98409 --> up =     0 , down =     0 -- rand =   12 (  29)
Pass  11: obj.    7.66326 --> up =     3 , down =     6
Pass  12: obj.    1.87012 --> up =     0 , down =     0 -- rand =    9 (  23)
Pass  13: obj.    6.89777 --> up =     0 , down =     7
Pass  14: obj.    1.74380 --> up =     0 , down =     0 -- rand =   10 (  23)
Pass  15: obj.    7.99820 --> up =     0 , down =     8 perturbation applied
Pass  16: obj.   42.30814 --> up =     3 , down =    40
Pass  17: obj.    0.99328 --> up =     0 , down =     0 -- rand =    7 (  24)
Pass  18: obj.    5.42095 --> up =     0 , down =     6
Pass  19: obj.    1.43182 --> up =     0 , down =     0 -- rand =    8 (  10)
Pass  20: obj.    6.48182 --> up =     3 , down =     5 perturbation applied
Pass  21: obj.   45.18182 --> No solution found this major pass
Before mini branch and bound, 178 integers at bound fixed and 181 continuous
Full problem 285 rows 504 columns, reduced to 100 rows 142 columns
Mini branch and bound did not improve solution (0.18 seconds)
After 0.18 seconds - Feasibility pump exiting - took 0.18 seconds
Integer solution of 4033 found by feasibility pump after 0 iterations and 0 nodes (0.18 seconds)
Full problem 285 rows 504 columns, reduced to 0 rows 0 columns
43 added rows had average density of 106.628
At root node, 43 cuts changed objective from 3157.38 to 3437.79 in 39 passes
Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts  in 0.872 seconds - new frequency is 10
Cut generator 1 (Gomory) - 1551 row cuts (7 active), 0 column cuts  in 0.156 seconds - new frequency is 1
Cut generator 2 (Knapsack) - 95 row cuts (7 active), 0 column cuts  in 0.084 seconds - new frequency is -100
Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts  in 0.004 seconds - new frequency is -100
Cut generator 4 (MixedIntegerRounding2) - 277 row cuts (29 active), 0 column cuts  in 0.024 seconds - new frequency is 1
Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts  in -0.000 seconds - new frequency is -100
Cut generator 6 (TwoMirCuts) - 62 row cuts (0 active), 0 column cuts  in 0.068 seconds - new frequency is -100
After 0 nodes, 1 on tree, 4033 best solution, best possible 3437.79 (2.47 seconds)
After 1000 nodes, 121 on tree, 4033 best solution, best possible 3443.64 (8.80 seconds)
After 2000 nodes, 135 on tree, 4033 best solution, best possible 3443.64 (10.36 seconds)
Integer solution of 4028 found after 24018 iterations and 2747 nodes (11.42 seconds)
Full problem 285 rows 504 columns, reduced to 37 rows 46 columns
Integer solution of 3893 found by combine solutions after 24042 iterations and 2748 nodes (11.88 seconds)
Integer solution of 3854 found by rounding after 24288 iterations and 2762 nodes (11.93 seconds)
Full problem 285 rows 504 columns, reduced to 58 rows 74 columns
Integer solution of 3826 found by rounding after 28125 iterations and 2953 nodes (14.01 seconds)
Full problem 285 rows 504 columns, reduced to 59 rows 76 columns
Integer solution of 3779 found by combine solutions after 28155 iterations and 2954 nodes (15.61 seconds)
After 3000 nodes, 187 on tree, 3779 best solution, best possible 3443.64 (15.82 seconds)
Integer solution of 3766 found by rounding after 37219 iterations and 3380 nodes (16.93 seconds)
Full problem 285 rows 504 columns, reduced to 68 rows 89 columns
Integer solution of 3731 found by rounding after 44534 iterations and 3612 nodes (19.69 seconds)
Full problem 285 rows 504 columns, reduced to 70 rows 92 columns
After 4000 nodes, 606 on tree, 3731 best solution, best possible 3512.53 (22.84 seconds)
After 5000 nodes, 1089 on tree, 3731 best solution, best possible 3529.23 (25.90 seconds)
After 6000 nodes, 1558 on tree, 3731 best solution, best possible 3539.89 (28.89 seconds)
After 7000 nodes, 2023 on tree, 3731 best solution, best possible 3547.19 (31.76 seconds)
After 8000 nodes, 2469 on tree, 3731 best solution, best possible 3553.44 (34.46 seconds)
After 9000 nodes, 2917 on tree, 3731 best solution, best possible 3558.58 (37.18 seconds)
After 10000 nodes, 3336 on tree, 3731 best solution, best possible 3562.81 (39.83 seconds)
After 11000 nodes, 3754 on tree, 3731 best solution, best possible 3566.73 (42.45 seconds)
After 12000 nodes, 4158 on tree, 3731 best solution, best possible 3570.02 (45.04 seconds)
After 13000 nodes, 4569 on tree, 3731 best solution, best possible 3573.26 (47.60 seconds)
Integer solution of 3714 found by rounding after 246220 iterations and 13245 nodes (48.15 seconds)
Full problem 285 rows 504 columns, reduced to 74 rows 99 columns
After 14000 nodes, 4626 on tree, 3714 best solution, best possible 3575.33 (52.03 seconds)
After 15000 nodes, 4989 on tree, 3714 best solution, best possible 3577.99 (54.65 seconds)
After 16000 nodes, 5358 on tree, 3714 best solution, best possible 3580.43 (57.31 seconds)
After 17000 nodes, 5692 on tree, 3714 best solution, best possible 3582.82 (59.84 seconds)
Integer solution of 3681 found by rounding after 311883 iterations and 17300 nodes (60.48 seconds)
Full problem 285 rows 504 columns, reduced to 74 rows 99 columns
After 18000 nodes, 4878 on tree, 3681 best solution, best possible 3584.51 (64.22 seconds)
After 19000 nodes, 5082 on tree, 3681 best solution, best possible 3586.7 (66.72 seconds)
After 20000 nodes, 5285 on tree, 3681 best solution, best possible 3588.48 (69.28 seconds)
After 21000 nodes, 5486 on tree, 3681 best solution, best possible 3590.22 (71.77 seconds)
Integer solution of 3664 found by rounding after 356424 iterations and 21045 nodes (71.85 seconds)
Full problem 285 rows 504 columns, reduced to 74 rows 99 columns
After 22000 nodes, 4850 on tree, 3664 best solution, best possible 3591.96 (76.04 seconds)
After 23000 nodes, 4969 on tree, 3664 best solution, best possible 3593.76 (78.54 seconds)
After 24000 nodes, 5114 on tree, 3664 best solution, best possible 3595.32 (81.12 seconds)
After 25000 nodes, 5243 on tree, 3664 best solution, best possible 3596.78 (83.53 seconds)
After 26000 nodes, 5360 on tree, 3664 best solution, best possible 3596.78 (85.59 seconds)
After 27000 nodes, 5496 on tree, 3664 best solution, best possible 3598.53 (88.27 seconds)
After 28000 nodes, 5625 on tree, 3664 best solution, best possible 3600.15 (90.96 seconds)
After 29000 nodes, 5738 on tree, 3664 best solution, best possible 3601.81 (93.57 seconds)
After 30000 nodes, 5817 on tree, 3664 best solution, best possible 3601.81 (95.54 seconds)
After 31000 nodes, 5923 on tree, 3664 best solution, best possible 3603.53 (98.13 seconds)
After 32000 nodes, 6027 on tree, 3664 best solution, best possible 3605.14 (100.88 seconds)
After 33000 nodes, 6118 on tree, 3664 best solution, best possible 3606.64 (103.15 seconds)
After 34000 nodes, 6174 on tree, 3664 best solution, best possible 3606.64 (105.10 seconds)
After 35000 nodes, 6250 on tree, 3664 best solution, best possible 3608.11 (107.36 seconds)
After 36000 nodes, 6339 on tree, 3664 best solution, best possible 3609.54 (109.79 seconds)
After 37000 nodes, 6409 on tree, 3664 best solution, best possible 3611.04 (112.56 seconds)
After 38000 nodes, 6450 on tree, 3664 best solution, best possible 3611.04 (114.31 seconds)
After 39000 nodes, 6546 on tree, 3664 best solution, best possible 3612.61 (117.13 seconds)
After 40000 nodes, 6612 on tree, 3664 best solution, best possible 3614.07 (119.98 seconds)
After 41000 nodes, 6678 on tree, 3664 best solution, best possible 3615.5 (122.61 seconds)
After 42000 nodes, 6713 on tree, 3664 best solution, best possible 3615.5 (124.34 seconds)
After 43000 nodes, 6760 on tree, 3664 best solution, best possible 3616.97 (127.04 seconds)
After 44000 nodes, 6827 on tree, 3664 best solution, best possible 3618.46 (129.71 seconds)
After 45000 nodes, 6883 on tree, 3664 best solution, best possible 3619.82 (132.55 seconds)
After 46000 nodes, 6909 on tree, 3664 best solution, best possible 3619.82 (134.37 seconds)
After 47000 nodes, 6953 on tree, 3664 best solution, best possible 3621.24 (136.91 seconds)
After 48000 nodes, 6986 on tree, 3664 best solution, best possible 3622.52 (139.47 seconds)
After 49000 nodes, 7033 on tree, 3664 best solution, best possible 3623.86 (141.68 seconds)
After 50000 nodes, 7019 on tree, 3664 best solution, best possible 3623.86 (143.46 seconds)
After 51000 nodes, 7060 on tree, 3664 best solution, best possible 3625.04 (145.34 seconds)
After 52000 nodes, 7096 on tree, 3664 best solution, best possible 3626.08 (147.31 seconds)
After 53000 nodes, 7112 on tree, 3664 best solution, best possible 3627.25 (149.81 seconds)
After 54000 nodes, 7076 on tree, 3664 best solution, best possible 3627.25 (151.41 seconds)
After 55000 nodes, 7088 on tree, 3664 best solution, best possible 3628.61 (154.12 seconds)
After 56000 nodes, 7078 on tree, 3664 best solution, best possible 3629.8 (156.60 seconds)
After 57000 nodes, 7068 on tree, 3664 best solution, best possible 3630.98 (159.13 seconds)
After 58000 nodes, 7002 on tree, 3664 best solution, best possible 3630.98 (160.79 seconds)
After 59000 nodes, 6987 on tree, 3664 best solution, best possible 3632.09 (163.41 seconds)
After 60000 nodes, 6979 on tree, 3664 best solution, best possible 3633.26 (166.10 seconds)
After 61000 nodes, 6967 on tree, 3664 best solution, best possible 3634.23 (168.65 seconds)
After 62000 nodes, 6885 on tree, 3664 best solution, best possible 3634.23 (170.28 seconds)
After 63000 nodes, 6854 on tree, 3664 best solution, best possible 3635.29 (172.75 seconds)
After 64000 nodes, 6820 on tree, 3664 best solution, best possible 3636.35 (175.43 seconds)
After 65000 nodes, 6789 on tree, 3664 best solution, best possible 3637.35 (177.92 seconds)
After 66000 nodes, 6671 on tree, 3664 best solution, best possible 3637.35 (179.57 seconds)
After 67000 nodes, 6678 on tree, 3664 best solution, best possible 3638.35 (181.49 seconds)
After 68000 nodes, 6682 on tree, 3664 best solution, best possible 3639.23 (183.50 seconds)
After 69000 nodes, 6675 on tree, 3664 best solution, best possible 3640.05 (185.37 seconds)
After 70000 nodes, 6536 on tree, 3664 best solution, best possible 3640.06 (186.92 seconds)
After 71000 nodes, 6518 on tree, 3664 best solution, best possible 3641.08 (188.78 seconds)
After 72000 nodes, 6506 on tree, 3664 best solution, best possible 3641.93 (190.67 seconds)
After 73000 nodes, 6476 on tree, 3664 best solution, best possible 3642.81 (192.51 seconds)
After 74000 nodes, 6299 on tree, 3664 best solution, best possible 3642.81 (193.99 seconds)
After 75000 nodes, 6268 on tree, 3664 best solution, best possible 3643.72 (195.80 seconds)
After 76000 nodes, 6236 on tree, 3664 best solution, best possible 3644.5 (197.65 seconds)
After 77000 nodes, 6176 on tree, 3664 best solution, best possible 3645.27 (199.46 seconds)
After 78000 nodes, 5969 on tree, 3664 best solution, best possible 3645.28 (201.10 seconds)
After 79000 nodes, 5927 on tree, 3664 best solution, best possible 3646.25 (202.98 seconds)
After 80000 nodes, 5875 on tree, 3664 best solution, best possible 3647.1 (204.71 seconds)
After 81000 nodes, 5833 on tree, 3664 best solution, best possible 3647.9 (206.59 seconds)
After 82000 nodes, 5618 on tree, 3664 best solution, best possible 3647.9 (208.23 seconds)
After 83000 nodes, 5547 on tree, 3664 best solution, best possible 3648.77 (210.00 seconds)
After 84000 nodes, 5416 on tree, 3664 best solution, best possible 3649.54 (212.12 seconds)
After 85000 nodes, 5282 on tree, 3664 best solution, best possible 3650.35 (214.09 seconds)
After 86000 nodes, 5060 on tree, 3664 best solution, best possible 3650.35 (215.43 seconds)
After 87000 nodes, 4907 on tree, 3664 best solution, best possible 3651.25 (217.26 seconds)
After 88000 nodes, 4756 on tree, 3664 best solution, best possible 3652.13 (219.07 seconds)
After 89000 nodes, 4597 on tree, 3664 best solution, best possible 3652.96 (220.87 seconds)
After 90000 nodes, 4351 on tree, 3664 best solution, best possible 3652.96 (222.25 seconds)
After 91000 nodes, 4183 on tree, 3664 best solution, best possible 3653.88 (224.04 seconds)
After 92000 nodes, 3990 on tree, 3664 best solution, best possible 3654.7 (225.77 seconds)
After 93000 nodes, 3793 on tree, 3664 best solution, best possible 3655.5 (227.57 seconds)
After 94000 nodes, 3509 on tree, 3664 best solution, best possible 3655.5 (228.94 seconds)
After 95000 nodes, 3342 on tree, 3664 best solution, best possible 3656.28 (230.54 seconds)
After 96000 nodes, 3149 on tree, 3664 best solution, best possible 3657.13 (232.14 seconds)
After 97000 nodes, 2952 on tree, 3664 best solution, best possible 3657.88 (233.71 seconds)
After 98000 nodes, 2616 on tree, 3664 best solution, best possible 3657.88 (235.09 seconds)
After 99000 nodes, 2397 on tree, 3664 best solution, best possible 3658.73 (236.68 seconds)
After 100000 nodes, 2155 on tree, 3664 best solution, best possible 3659.59 (238.27 seconds)
After 101000 nodes, 1886 on tree, 3664 best solution, best possible 3660.32 (239.79 seconds)
After 102000 nodes, 1516 on tree, 3664 best solution, best possible 3660.32 (241.17 seconds)
After 103000 nodes, 1213 on tree, 3664 best solution, best possible 3661.28 (242.76 seconds)
After 104000 nodes, 872 on tree, 3664 best solution, best possible 3662.11 (244.38 seconds)
After 105000 nodes, 509 on tree, 3664 best solution, best possible 3662.99 (245.95 seconds)
After 106000 nodes, 98 on tree, 3664 best solution, best possible 3662.99 (247.37 seconds)
Search completed - best objective 3664, took 848116 iterations and 106229 nodes (247.74 seconds)
Strong branching done 25532 times (253898 iterations), fathomed 1324 nodes and fixed 5849 variables
Maximum depth 79, 1.03885e+06 variables fixed on reduced cost
Cuts at root node changed objective from 3157.38 to 3437.79
Probing was tried 6260 times and created 3451 cuts of which 1516 were active after adding rounds of cuts (3.412 seconds)
Gomory was tried 11692 times and created 8047 cuts of which 3181 were active after adding rounds of cuts (6.360 seconds)
Knapsack was tried 39 times and created 95 cuts of which 7 were active after adding rounds of cuts (0.084 seconds)
Clique was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds)
MixedIntegerRounding2 was tried 13329 times and created 30017 cuts of which 19939 were active after adding rounds of cuts (3.960 seconds)
FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds)
TwoMirCuts was tried 39 times and created 62 cuts of which 0 were active after adding rounds of cuts (0.068 seconds)
Result - Finished objective 3664 after 106229 nodes and 848116 iterations - took 247.75 seconds (total time 247.76)
Total time 247.76

Solved to optimality.
Writing solution. Objective: 3664 Time: 247.76 s
--- Restarting execution
--- ran12x21.gms(124) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job ran12x21.gms Stop 08/21/08 11:52:20 elapsed 0:04:09.304