--- Job seymour1 Start 08/21/08 13:44:12
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
--- seymour1.gms(106) 2 Mb
--- GDXin=/home/stefan/work/gams/models/LINlib/seymour1.gdx
--- seymour1.gms(148) 4 Mb
--- Starting execution: elapsed 0:00:00.071
--- seymour1.gms(123) 5 Mb
--- Generating MIP model m
--- seymour1.gms(124) 7 Mb
---   4,945 rows  1,373 columns  34,922 non-zeroes
---   451 discrete-columns
--- seymour1.gms(124) 7 Mb
--- Executing COINCBC: elapsed 0:00:00.179

GAMS/CoinCbc 2.0 LP/MIP Solver
written by J. Forrest
Problem statistics: 1372 columns and 4944 rows.
                    451 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 403.846 - 1.85 seconds
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions
processed model has 4808 rows, 1153 columns (309 integer) and 33047 elements
Pass   1: (0.48 seconds) obj.   33.62500 --> up =    11 , down =     0
Pass   2: (0.49 seconds) obj.   23.00000 --> up =     0 , down =     0 -- rand =   21 (  21)
Pass   3: (0.51 seconds) obj.   11.00000 --> up =     7 , down =     0
Full problem 4809 rows 1153 columns, reduced to 3273 rows 835 columns - too large
Pass   4: (0.52 seconds) obj.    4.00000 --> up =     0 , down =     0 -- rand =   10 (  23)  - solution found of 440 - mini branch and bound could not fix general integers
No solution found this major pass
Before mini branch and bound, 148 integers at bound fixed and 323 continuous of which 1 were internal integer and 0 internal continuous
Full problem 4808 rows 1153 columns, reduced to 4447 rows 682 columns - too large
Mini branch and bound did not improve solution (1.14 seconds)
After 1.14 seconds - Feasibility pump exiting - took 1.14 seconds
Integer solution of 458.557 found by greedy cover after 0 iterations and 0 nodes (2.39 seconds)
Full problem 4808 rows 1153 columns, reduced to 3345 rows 877 columns - too large
Integer solution of 422.233 found by rounding after 2265 iterations and 0 nodes (5.56 seconds)
14 added rows had average density of 4.35714
At root node, 14 cuts changed objective from 403.846 to 405.516 in 4 passes
Cut generator 0 (Probing) - 14 row cuts (11 active), 0 column cuts  in 0.032 seconds - new frequency is 1
Cut generator 1 (Gomory) - 155 row cuts (1 active), 0 column cuts  in 0.096 seconds - new frequency is -100
Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts  in 0.008 seconds - new frequency is -100
Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts  in 0.000 seconds - new frequency is -100
Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts  in 0.008 seconds - new frequency is -100
Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts  in 0.012 seconds - new frequency is -100
Cut generator 6 (TwoMirCuts) - 79 row cuts (2 active), 0 column cuts  in 0.156 seconds - new frequency is -100
After 0 nodes, 1 on tree, 422.233 best solution, best possible 405.516 (6.27 seconds)
Full problem 4808 rows 1153 columns, reduced to 4473 rows 987 columns - too large
Integer solution of 414.337 found by greedy cover after 2266 iterations and 1 nodes (8.04 seconds)
Full problem 4808 rows 1153 columns, reduced to 4495 rows 995 columns - too large
After 100 nodes, 53 on tree, 414.337 best solution, best possible 406.182 (90.14 seconds)
After 200 nodes, 84 on tree, 414.337 best solution, best possible 406.182 (134.80 seconds)
After 300 nodes, 81 on tree, 414.337 best solution, best possible 406.182 (152.06 seconds)
After 400 nodes, 80 on tree, 414.337 best solution, best possible 406.182 (167.53 seconds)
After 500 nodes, 78 on tree, 414.337 best solution, best possible 406.182 (184.02 seconds)
After 600 nodes, 81 on tree, 414.337 best solution, best possible 406.182 (201.55 seconds)
After 700 nodes, 85 on tree, 414.337 best solution, best possible 406.182 (217.63 seconds)
After 800 nodes, 78 on tree, 414.337 best solution, best possible 406.182 (232.54 seconds)
After 900 nodes, 79 on tree, 414.337 best solution, best possible 406.182 (248.95 seconds)
After 1000 nodes, 82 on tree, 414.337 best solution, best possible 406.182 (264.20 seconds)
After 1100 nodes, 83 on tree, 414.337 best solution, best possible 406.182 (277.98 seconds)
After 1200 nodes, 83 on tree, 414.337 best solution, best possible 406.182 (291.52 seconds)
After 1300 nodes, 80 on tree, 414.337 best solution, best possible 406.182 (306.15 seconds)
After 1400 nodes, 83 on tree, 414.337 best solution, best possible 406.182 (321.20 seconds)
After 1500 nodes, 81 on tree, 414.337 best solution, best possible 406.182 (337.09 seconds)
After 1600 nodes, 79 on tree, 414.337 best solution, best possible 406.182 (354.06 seconds)
After 1700 nodes, 77 on tree, 414.337 best solution, best possible 406.182 (372.61 seconds)
After 1800 nodes, 79 on tree, 414.337 best solution, best possible 406.182 (392.68 seconds)
After 1900 nodes, 76 on tree, 414.337 best solution, best possible 406.182 (413.77 seconds)
After 2000 nodes, 74 on tree, 414.337 best solution, best possible 406.182 (434.25 seconds)
After 2100 nodes, 70 on tree, 414.337 best solution, best possible 406.182 (458.22 seconds)
After 2200 nodes, 69 on tree, 414.337 best solution, best possible 406.182 (475.69 seconds)
After 2300 nodes, 71 on tree, 414.337 best solution, best possible 406.182 (495.09 seconds)
After 2400 nodes, 69 on tree, 414.337 best solution, best possible 406.182 (517.29 seconds)
After 2500 nodes, 73 on tree, 414.337 best solution, best possible 406.182 (539.03 seconds)
After 2600 nodes, 71 on tree, 414.337 best solution, best possible 406.182 (562.84 seconds)
After 2700 nodes, 74 on tree, 414.337 best solution, best possible 406.182 (580.46 seconds)
After 2800 nodes, 78 on tree, 414.337 best solution, best possible 406.182 (602.79 seconds)
After 2900 nodes, 74 on tree, 414.337 best solution, best possible 406.182 (621.89 seconds)
After 3000 nodes, 77 on tree, 414.337 best solution, best possible 406.182 (636.86 seconds)
After 3100 nodes, 74 on tree, 414.337 best solution, best possible 406.182 (651.97 seconds)
After 3200 nodes, 71 on tree, 414.337 best solution, best possible 406.182 (670.16 seconds)
After 3300 nodes, 73 on tree, 414.337 best solution, best possible 406.182 (687.14 seconds)
After 3400 nodes, 69 on tree, 414.337 best solution, best possible 406.182 (710.71 seconds)
Integer solution of 414.303 found after 678036 iterations and 3439 nodes (717.53 seconds)
Full problem 4808 rows 1153 columns, reduced to 4525 rows 1009 columns - too large
After 3500 nodes, 121 on tree, 414.303 best solution, best possible 406.182 (740.25 seconds)
Integer solution of 412.371 found by rounding after 744749 iterations and 3580 nodes (764.09 seconds)
Full problem 4808 rows 1153 columns, reduced to 4528 rows 1011 columns - too large
Integer solution of 411.635 found by rounding after 749313 iterations and 3598 nodes (767.62 seconds)
Full problem 4808 rows 1153 columns, reduced to 4553 rows 1013 columns - too large
After 3600 nodes, 143 on tree, 411.635 best solution, best possible 406.182 (768.32 seconds)
Integer solution of 411.627 found after 750268 iterations and 3611 nodes (769.54 seconds)
Full problem 4808 rows 1153 columns, reduced to 4553 rows 1013 columns - too large
Integer solution of 411.505 found after 750903 iterations and 3617 nodes (770.92 seconds)
Full problem 4808 rows 1153 columns, reduced to 4553 rows 1014 columns - too large
Integer solution of 411.086 found after 759256 iterations and 3644 nodes (779.36 seconds)
Full problem 4808 rows 1153 columns, reduced to 4553 rows 1014 columns - too large
After 3700 nodes, 162 on tree, 411.086 best solution, best possible 407.446 (802.83 seconds)
After 3800 nodes, 212 on tree, 411.086 best solution, best possible 407.926 (831.85 seconds)
After 3900 nodes, 262 on tree, 411.086 best solution, best possible 408.221 (860.75 seconds)
After 4000 nodes, 312 on tree, 411.086 best solution, best possible 408.412 (890.26 seconds)
After 4100 nodes, 362 on tree, 411.086 best solution, best possible 408.572 (917.93 seconds)
After 4200 nodes, 412 on tree, 411.086 best solution, best possible 408.692 (946.99 seconds)
After 4300 nodes, 462 on tree, 411.086 best solution, best possible 408.772 (975.59 seconds)
After 4400 nodes, 512 on tree, 411.086 best solution, best possible 408.86 (1004.63 seconds)
After 4500 nodes, 562 on tree, 411.086 best solution, best possible 408.959 (1031.35 seconds)
After 4600 nodes, 612 on tree, 411.086 best solution, best possible 409.036 (1059.63 seconds)
After 4700 nodes, 662 on tree, 411.086 best solution, best possible 409.113 (1087.77 seconds)
After 4800 nodes, 712 on tree, 411.086 best solution, best possible 409.166 (1115.42 seconds)
After 4900 nodes, 761 on tree, 411.086 best solution, best possible 409.216 (1143.55 seconds)
After 5000 nodes, 811 on tree, 411.086 best solution, best possible 409.267 (1171.47 seconds)
After 5100 nodes, 859 on tree, 411.086 best solution, best possible 409.314 (1198.48 seconds)
After 5200 nodes, 908 on tree, 411.086 best solution, best possible 409.352 (1226.12 seconds)
After 5300 nodes, 958 on tree, 411.086 best solution, best possible 409.39 (1254.76 seconds)
After 5400 nodes, 1006 on tree, 411.086 best solution, best possible 409.427 (1281.43 seconds)
After 5500 nodes, 1053 on tree, 411.086 best solution, best possible 409.47 (1308.36 seconds)
After 5600 nodes, 1101 on tree, 411.086 best solution, best possible 409.5 (1334.53 seconds)
After 5700 nodes, 1149 on tree, 411.086 best solution, best possible 409.532 (1362.70 seconds)
After 5800 nodes, 1198 on tree, 411.086 best solution, best possible 409.566 (1388.74 seconds)
After 5900 nodes, 1247 on tree, 411.086 best solution, best possible 409.594 (1413.85 seconds)
After 6000 nodes, 1290 on tree, 411.086 best solution, best possible 409.625 (1440.35 seconds)
After 6100 nodes, 1337 on tree, 411.086 best solution, best possible 409.646 (1466.13 seconds)
After 6200 nodes, 1383 on tree, 411.086 best solution, best possible 409.672 (1492.43 seconds)
After 6300 nodes, 1426 on tree, 411.086 best solution, best possible 409.697 (1519.59 seconds)
After 6400 nodes, 1469 on tree, 411.086 best solution, best possible 409.718 (1545.14 seconds)
After 6500 nodes, 1512 on tree, 411.086 best solution, best possible 409.74 (1569.50 seconds)
After 6600 nodes, 1554 on tree, 411.086 best solution, best possible 409.761 (1594.18 seconds)
After 6700 nodes, 1595 on tree, 411.086 best solution, best possible 409.776 (1618.87 seconds)
After 6800 nodes, 1637 on tree, 411.086 best solution, best possible 409.792 (1642.54 seconds)
After 6900 nodes, 1682 on tree, 411.086 best solution, best possible 409.811 (1667.64 seconds)
After 7000 nodes, 1723 on tree, 411.086 best solution, best possible 409.834 (1691.01 seconds)
After 7100 nodes, 1760 on tree, 411.086 best solution, best possible 409.851 (1715.17 seconds)
After 7200 nodes, 1800 on tree, 411.086 best solution, best possible 409.865 (1737.07 seconds)
After 7300 nodes, 1836 on tree, 411.086 best solution, best possible 409.884 (1760.41 seconds)
After 7400 nodes, 1874 on tree, 411.086 best solution, best possible 409.898 (1784.24 seconds)
Exiting on maximum time
Partial search - best objective 411.086 (best possible 409.912), took 2476076 iterations and 7460 nodes (1799.48 seconds)
Strong branching done 3950 times (212033 iterations), fathomed 2 nodes and fixed 6 variables
Maximum depth 35, 31177 variables fixed on reduced cost
Cuts at root node changed objective from 403.846 to 405.516
Probing was tried 5709 times and created 1349 cuts of which 1019 were active after adding rounds of cuts (22.401 seconds)
Gomory was tried 4 times and created 155 cuts of which 1 were active after adding rounds of cuts (0.096 seconds)
Knapsack was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds)
Clique was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds)
FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds)
TwoMirCuts was tried 4 times and created 79 cuts of which 2 were active after adding rounds of cuts (0.156 seconds)
Result - Stopped on time objective 411.0857480825543 after 7460 nodes and 2476076 iterations - took 1800.27 seconds (total time 1802.13)
Total time 1825.82

Time limit reached. Have feasible solution.
Writing solution. Objective: 411.086 Time: 1825.83 s
--- Restarting execution
--- seymour1.gms(124) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job seymour1.gms Stop 08/21/08 14:14:42 elapsed 0:30:29.452