--- Job ran13x13 Start 08/22/08 01:53:33
GAMS Rev 228  Copyright (C) 1987-2008 GAMS Development. All rights reserved
Licensee: Stefan Vigerske                                G071106/0001CB-LNX
          Humboldt University Berlin, Numerical Mathematics          DC5918
--- Starting compilation
--- ran13x13.gms(106) 2 Mb
--- GDXin=/home/stefan/work/gams/models/LINlib/ran13x13.gdx
--- ran13x13.gms(148) 3 Mb
--- Starting execution: elapsed 0:00:00.005
--- ran13x13.gms(123) 4 Mb
--- Generating MIP model m
--- ran13x13.gms(124) 4 Mb
---   196 rows  339 columns  1,015 non-zeroes
---   169 discrete-columns
--- Executing COINCBC: elapsed 0:00:00.012

GAMS/CoinCbc 2.1 LP/MIP Solver
written by J. Forrest
Problem statistics: 338 columns and 195 rows.
                    169 variables have integrality restrictions.

Calling CBC main solution routine...
Coin Cbc and Clp Solver version 2.10.00, build Jun 21 2008
command line - GAMS/CBC -solve -quit
Continuous objective value is 2691.44 - 0.01 seconds
processed model has 195 rows, 338 columns (169 integer) and 676 elements
Pass   1: suminf.    0.95476 obj. 3004.65 iterations 71
Solution found of 3811
Before mini branch and bound, 146 integers at bound fixed and 145 continuous
Full problem 195 rows 338 columns, reduced to 26 rows 30 columns
Mini branch and bound improved solution from 3811 to 3494 (0.02 seconds)
Round again with cutoff of 3413.74
Pass   2: suminf.    0.95476 obj. 2988.15 iterations 64
Pass   3: suminf.    0.43790 obj. 3413.74 iterations 41
Pass   4: suminf.    0.07692 obj. 3363.08 iterations 26
Pass   5: suminf.    0.30515 obj. 3413.74 iterations 21
Pass   6: suminf.    3.51470 obj. 3413.74 iterations 69
Pass   7: suminf.    2.20761 obj. 3413.74 iterations 39
Pass   8: suminf.    1.58309 obj. 3413.74 iterations 28
Pass   9: suminf.    1.51420 obj. 3413.74 iterations 20
Pass  10: suminf.    2.19016 obj. 3413.74 iterations 38
Pass  11: suminf.    1.91174 obj. 3413.74 iterations 3
Pass  12: suminf.    1.21802 obj. 3413.74 iterations 54
Pass  13: suminf.    0.88558 obj. 3413.74 iterations 19
Pass  14: suminf.    1.06514 obj. 3413.74 iterations 29
Pass  15: suminf.    1.04708 obj. 3413.74 iterations 19
Pass  16: suminf.    1.28559 obj. 3413.74 iterations 33
Pass  17: suminf.    1.19191 obj. 3413.74 iterations 12
Pass  18: suminf.    1.14244 obj. 3413.74 iterations 21
Pass  19: suminf.    0.58183 obj. 3413.74 iterations 20
Pass  20: suminf.    1.05466 obj. 3413.74 iterations 14
Pass  21: suminf.    2.42353 obj. 3413.74 iterations 85
Before mini branch and bound, 118 integers at bound fixed and 119 continuous
Full problem 195 rows 338 columns, reduced to 66 rows 91 columns
Mini branch and bound did not improve solution (0.12 seconds)
After 0.12 seconds - Feasibility pump exiting with objective of 6 - took 0.12 seconds
Integer solution of 3811 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds)
Full problem 195 rows 338 columns, reduced to 0 rows 0 columns
44 added rows had average density of 83.5455
At root node, 44 cuts changed objective from 2691.44 to 2994.91 in 45 passes
Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts  in 0.132 seconds - new frequency is 10
Cut generator 1 (Gomory) - 47 row cuts (9 active), 0 column cuts  in 0.068 seconds - new frequency is 1
Cut generator 2 (Knapsack) - 53 row cuts (4 active), 0 column cuts  in 0.084 seconds - new frequency is 1
Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts  in 0.012 seconds - new frequency is -100
Cut generator 4 (MixedIntegerRounding2) - 117 row cuts (17 active), 0 column cuts  in 0.004 seconds - new frequency is 1
Cut generator 5 (FlowCover) - 80 row cuts (9 active), 0 column cuts  in 0.088 seconds - new frequency is 1
Cut generator 6 (TwoMirCuts) - 30 row cuts (1 active), 0 column cuts  in 0.040 seconds - new frequency is -100
After 0 nodes, 1 on tree, 3811 best solution, best possible 2994.91 (0.92 seconds)
Integer solution of 3794 found after 8404 iterations and 237 nodes (3.80 seconds)
Full problem 195 rows 338 columns, reduced to 45 rows 58 columns
Integer solution of 3591 found by combine solutions after 8427 iterations and 238 nodes (4.35 seconds)
Integer solution of 3578 found by combine solutions after 8468 iterations and 239 nodes (4.36 seconds)
Integer solution of 3525 found by combine solutions after 8477 iterations and 240 nodes (4.36 seconds)
After 1000 nodes, 460 on tree, 3525 best solution, best possible 3006.47 (7.32 seconds)
After 2000 nodes, 952 on tree, 3525 best solution, best possible 3006.47 (10.30 seconds)
After 3000 nodes, 1424 on tree, 3525 best solution, best possible 3006.47 (12.94 seconds)
Integer solution of 3493 found after 81591 iterations and 3992 nodes (15.44 seconds)
Full problem 195 rows 338 columns, reduced to 54 rows 70 columns
Integer solution of 3480 found by combine solutions after 81611 iterations and 3993 nodes (16.15 seconds)
After 4000 nodes, 1756 on tree, 3480 best solution, best possible 3010.71 (16.21 seconds)
After 5000 nodes, 2255 on tree, 3480 best solution, best possible 3122.2 (20.99 seconds)
After 6000 nodes, 2755 on tree, 3480 best solution, best possible 3141.94 (25.24 seconds)
After 7000 nodes, 3250 on tree, 3480 best solution, best possible 3152.56 (29.33 seconds)
After 8000 nodes, 3748 on tree, 3480 best solution, best possible 3160.33 (33.87 seconds)
After 9000 nodes, 4248 on tree, 3480 best solution, best possible 3166.67 (38.43 seconds)
After 10000 nodes, 4748 on tree, 3480 best solution, best possible 3172.33 (42.99 seconds)
After 11000 nodes, 5246 on tree, 3480 best solution, best possible 3177.26 (47.45 seconds)
After 12000 nodes, 5743 on tree, 3480 best solution, best possible 3182.2 (51.81 seconds)
After 13000 nodes, 6241 on tree, 3480 best solution, best possible 3186.14 (56.20 seconds)
Integer solution of 3357 found after 378969 iterations and 13408 nodes (57.54 seconds)
Full problem 195 rows 338 columns, reduced to 59 rows 78 columns
After 14000 nodes, 5207 on tree, 3357 best solution, best possible 3188.19 (60.89 seconds)
After 15000 nodes, 5616 on tree, 3357 best solution, best possible 3191.78 (64.81 seconds)
After 16000 nodes, 6008 on tree, 3357 best solution, best possible 3195.05 (68.70 seconds)
After 17000 nodes, 6397 on tree, 3357 best solution, best possible 3197.94 (72.52 seconds)
Integer solution of 3334 found after 481779 iterations and 17560 nodes (74.16 seconds)
Full problem 195 rows 338 columns, reduced to 64 rows 85 columns
After 18000 nodes, 6116 on tree, 3334 best solution, best possible 3199.4 (76.78 seconds)
After 19000 nodes, 6441 on tree, 3334 best solution, best possible 3202.84 (80.51 seconds)
After 20000 nodes, 6784 on tree, 3334 best solution, best possible 3205.27 (84.07 seconds)
After 21000 nodes, 7105 on tree, 3334 best solution, best possible 3207.57 (87.63 seconds)
Full problem 195 rows 338 columns, reduced to 69 rows 93 columns
After 22000 nodes, 3151 on tree, 3252 best solution, best possible 3209.49 (91.52 seconds)
After 23000 nodes, 3196 on tree, 3252 best solution, best possible 3211.79 (94.26 seconds)
After 24000 nodes, 3245 on tree, 3252 best solution, best possible 3213.77 (96.88 seconds)
After 25000 nodes, 3277 on tree, 3252 best solution, best possible 3215.66 (99.45 seconds)
After 26000 nodes, 3234 on tree, 3252 best solution, best possible 3215.66 (101.36 seconds)
After 27000 nodes, 3267 on tree, 3252 best solution, best possible 3217.76 (104.01 seconds)
After 28000 nodes, 3305 on tree, 3252 best solution, best possible 3220.02 (106.64 seconds)
After 29000 nodes, 3313 on tree, 3252 best solution, best possible 3222.02 (109.16 seconds)
After 30000 nodes, 3222 on tree, 3252 best solution, best possible 3222.02 (110.97 seconds)
After 31000 nodes, 3211 on tree, 3252 best solution, best possible 3224.17 (113.49 seconds)
After 32000 nodes, 3201 on tree, 3252 best solution, best possible 3226.26 (115.97 seconds)
After 33000 nodes, 3168 on tree, 3252 best solution, best possible 3228.15 (118.42 seconds)
After 34000 nodes, 3015 on tree, 3252 best solution, best possible 3228.15 (120.15 seconds)
After 35000 nodes, 2981 on tree, 3252 best solution, best possible 3230.03 (122.62 seconds)
After 36000 nodes, 2930 on tree, 3252 best solution, best possible 3231.88 (125.01 seconds)
After 37000 nodes, 2877 on tree, 3252 best solution, best possible 3233.62 (127.34 seconds)
After 38000 nodes, 2684 on tree, 3252 best solution, best possible 3233.62 (128.97 seconds)
After 39000 nodes, 2605 on tree, 3252 best solution, best possible 3235.73 (131.30 seconds)
After 40000 nodes, 2510 on tree, 3252 best solution, best possible 3237.41 (133.57 seconds)
After 41000 nodes, 2403 on tree, 3252 best solution, best possible 3239.02 (135.76 seconds)
After 42000 nodes, 2173 on tree, 3252 best solution, best possible 3239.02 (137.36 seconds)
After 43000 nodes, 2047 on tree, 3252 best solution, best possible 3240.82 (139.61 seconds)
After 44000 nodes, 1893 on tree, 3252 best solution, best possible 3242.47 (141.81 seconds)
After 45000 nodes, 1713 on tree, 3252 best solution, best possible 3244.19 (143.91 seconds)
After 46000 nodes, 1412 on tree, 3252 best solution, best possible 3244.19 (145.46 seconds)
After 47000 nodes, 1242 on tree, 3252 best solution, best possible 3246.21 (147.66 seconds)
After 48000 nodes, 1011 on tree, 3252 best solution, best possible 3247.98 (149.61 seconds)
After 49000 nodes, 702 on tree, 3252 best solution, best possible 3249.48 (151.51 seconds)
After 50000 nodes, 324 on tree, 3252 best solution, best possible 3249.49 (152.96 seconds)
Search completed - best objective 3252, took 841973 iterations and 50815 nodes (154.49 seconds)
Strong branching done 2760 times (48817 iterations), fathomed 10 nodes and fixed 91 variables
Maximum depth 78, 529540 variables fixed on reduced cost
Cuts at root node changed objective from 2691.44 to 2994.91
Probing was tried 3723 times and created 2875 cuts of which 1349 were active after adding rounds of cuts (1.052 seconds)
Gomory was tried 31649 times and created 17987 cuts of which 7704 were active after adding rounds of cuts (12.865 seconds)
Knapsack was tried 34555 times and created 15902 cuts of which 3885 were active after adding rounds of cuts (26.794 seconds)
Clique was tried 45 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds)
MixedIntegerRounding2 was tried 34555 times and created 49728 cuts of which 34374 were active after adding rounds of cuts (6.316 seconds)
FlowCover was tried 34555 times and created 1870 cuts of which 903 were active after adding rounds of cuts (0.432 seconds)
TwoMirCuts was tried 45 times and created 30 cuts of which 1 were active after adding rounds of cuts (0.040 seconds)
Result - Finished objective 3252 after 50815 nodes and 841973 iterations - took 154.49 seconds (total time 154.50)
Total time 154.51

Solved to optimality.
MIP solution:                  3252   (50815 nodes, 154.5 seconds)
Best possible:                 3252
Absolute gap:                     0   (absolute tolerance optca: 0)
Relative gap:                     0   (relative tolerance optcr: 0)
--- Restarting execution
--- ran13x13.gms(124) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job ran13x13.gms Stop 08/22/08 01:56:09 elapsed 0:02:36.928