--- Job acc-tight-6 Start 07/17/08 12:01:31 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 --- acc-tight-6.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-6.gdx --- acc-tight-6.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.041 --- acc-tight-6.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-6.gms(124) 5 Mb --- 3,053 rows 1,340 columns 16,136 non-zeroes --- 1,339 discrete-columns --- acc-tight-6.gms(124) 5 Mb --- Executing Cbc: elapsed 0:00:00.100 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" Problem statistics: 1339 columns and 3052 rows. 1339 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 Continuous objective value is 0 - 1.02 seconds 4 variables fixed 165 fixed, 0 tightened bounds, 0 strengthened rows, 132 substitutions 165 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 105 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 29 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 1 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 5 substitutions processed model has 2619 rows, 1083 columns (1083 integer) and 13615 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 81.12349 obj. 0.208035 iterations 1196 Pass 2: suminf. 66.33098 obj. 0.0756397 iterations 1416 Pass 3: suminf. 62.18803 obj. 0.0348405 iterations 861 Pass 4: suminf. 58.82956 obj. 0.0173284 iterations 881 Pass 5: suminf. 56.42235 obj. 0 iterations 563 Pass 6: suminf. 54.35031 obj. 0.0252564 iterations 490 Pass 7: suminf. 54.08767 obj. 0 iterations 286 Pass 8: suminf. 53.86712 obj. 0 iterations 141 Pass 9: suminf. 53.76901 obj. 0.000292557 iterations 88 Pass 10: suminf. 51.79427 obj. 0.021349 iterations 874 Pass 11: suminf. 50.23469 obj. 0.0201165 iterations 365 Pass 12: suminf. 49.02249 obj. 0.00282991 iterations 366 Pass 13: suminf. 46.64886 obj. 0.0155178 iterations 378 Pass 14: suminf. 45.42502 obj. 0.000537608 iterations 414 Pass 15: suminf. 45.15411 obj. 0 iterations 188 Pass 16: suminf. 44.95140 obj. 4.44089e-16 iterations 160 Pass 17: suminf. 44.58700 obj. 2.59792e-14 iterations 430 Pass 18: suminf. 44.55911 obj. 0.00145002 iterations 75 Pass 19: suminf. 44.75509 obj. 0 iterations 554 Pass 20: suminf. 43.55184 obj. 0.0122559 iterations 337 No solution found this major pass Before mini branch and bound, 155 integers at bound fixed and 0 continuous Full problem 2619 rows 1083 columns, reduced to 2373 rows 927 columns - too large Mini branch and bound did not improve solution (4.09 seconds) After 4.09 seconds - Feasibility pump exiting - took 4.08 seconds 60 added rows had average density of 154.617 At root node, 60 cuts changed objective from 0 to 1.11022e-16 in 3 passes Cut generator 0 (Probing) - 401 row cuts (51 active), 0 column cuts in 0.088 seconds - new frequency is 1 Cut generator 1 (Gomory) - 419 row cuts (9 active), 0 column cuts in 0.568 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.228 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 1.11022e-16 (19.85 seconds) After 100 nodes, 39 on tree, 1e+50 best solution, best possible 1.11022e-16 (201.65 seconds) After 200 nodes, 53 on tree, 1e+50 best solution, best possible 1.11022e-16 (315.25 seconds) After 300 nodes, 52 on tree, 1e+50 best solution, best possible 1.11022e-16 (396.66 seconds) After 400 nodes, 43 on tree, 1e+50 best solution, best possible 1.11022e-16 (471.82 seconds) After 500 nodes, 50 on tree, 1e+50 best solution, best possible 1.11022e-16 (535.57 seconds) After 600 nodes, 54 on tree, 1e+50 best solution, best possible 1.11022e-16 (604.69 seconds) After 700 nodes, 48 on tree, 1e+50 best solution, best possible 1.11022e-16 (668.08 seconds) After 800 nodes, 58 on tree, 1e+50 best solution, best possible 1.11022e-16 (735.64 seconds) After 900 nodes, 55 on tree, 1e+50 best solution, best possible 1.11022e-16 (786.45 seconds) After 1000 nodes, 62 on tree, 1e+50 best solution, best possible 1.11022e-16 (835.84 seconds) After 1100 nodes, 57 on tree, 1e+50 best solution, best possible 1.11022e-16 (878.79 seconds) After 1200 nodes, 54 on tree, 1e+50 best solution, best possible 1.11022e-16 (928.09 seconds) After 1300 nodes, 60 on tree, 1e+50 best solution, best possible 1.11022e-16 (980.28 seconds) After 1400 nodes, 62 on tree, 1e+50 best solution, best possible 1.11022e-16 (1032.96 seconds) After 1500 nodes, 59 on tree, 1e+50 best solution, best possible 1.11022e-16 (1082.59 seconds) After 1600 nodes, 63 on tree, 1e+50 best solution, best possible 1.11022e-16 (1127.66 seconds) After 1700 nodes, 63 on tree, 1e+50 best solution, best possible 1.11022e-16 (1175.11 seconds) After 1800 nodes, 70 on tree, 1e+50 best solution, best possible 1.11022e-16 (1213.22 seconds) After 1900 nodes, 67 on tree, 1e+50 best solution, best possible 1.11022e-16 (1257.72 seconds) After 2000 nodes, 66 on tree, 1e+50 best solution, best possible 1.11022e-16 (1314.11 seconds) After 2100 nodes, 68 on tree, 1e+50 best solution, best possible 1.11022e-16 (1356.82 seconds) After 2200 nodes, 59 on tree, 1e+50 best solution, best possible 1.11022e-16 (1396.12 seconds) After 2300 nodes, 60 on tree, 1e+50 best solution, best possible 1.11022e-16 (1442.22 seconds) After 2400 nodes, 55 on tree, 1e+50 best solution, best possible 1.11022e-16 (1501.35 seconds) After 2500 nodes, 52 on tree, 1e+50 best solution, best possible 1.11022e-16 (1546.66 seconds) After 2600 nodes, 58 on tree, 1e+50 best solution, best possible 1.11022e-16 (1596.83 seconds) After 2700 nodes, 52 on tree, 1e+50 best solution, best possible 1.11022e-16 (1661.86 seconds) After 2800 nodes, 55 on tree, 1e+50 best solution, best possible 1.11022e-16 (1720.14 seconds) After 2900 nodes, 66 on tree, 1e+50 best solution, best possible 1.11022e-16 (1776.13 seconds) After 3000 nodes, 56 on tree, 1e+50 best solution, best possible 1.11022e-16 (1845.50 seconds) After 3100 nodes, 57 on tree, 1e+50 best solution, best possible 1.11022e-16 (1894.67 seconds) After 3200 nodes, 56 on tree, 1e+50 best solution, best possible 1.11022e-16 (1961.75 seconds) After 3300 nodes, 53 on tree, 1e+50 best solution, best possible 1.11022e-16 (2026.24 seconds) After 3400 nodes, 60 on tree, 1e+50 best solution, best possible 1.11022e-16 (2096.17 seconds) After 3500 nodes, 60 on tree, 1e+50 best solution, best possible 1.11022e-16 (2156.84 seconds) After 3600 nodes, 62 on tree, 1e+50 best solution, best possible 1.11022e-16 (2205.35 seconds) After 3700 nodes, 62 on tree, 1e+50 best solution, best possible 1.11022e-16 (2257.22 seconds) After 3800 nodes, 60 on tree, 1e+50 best solution, best possible 1.11022e-16 (2305.00 seconds) After 3900 nodes, 54 on tree, 1e+50 best solution, best possible 1.11022e-16 (2365.75 seconds) After 4000 nodes, 64 on tree, 1e+50 best solution, best possible 1.11022e-16 (2419.91 seconds) After 4100 nodes, 63 on tree, 1e+50 best solution, best possible 1.11022e-16 (2470.62 seconds) After 4200 nodes, 68 on tree, 1e+50 best solution, best possible 1.11022e-16 (2537.00 seconds) After 4300 nodes, 64 on tree, 1e+50 best solution, best possible 1.11022e-16 (2589.17 seconds) After 4400 nodes, 66 on tree, 1e+50 best solution, best possible 1.11022e-16 (2637.30 seconds) After 4500 nodes, 56 on tree, 1e+50 best solution, best possible 1.11022e-16 (2697.13 seconds) After 4600 nodes, 60 on tree, 1e+50 best solution, best possible 1.11022e-16 (2750.13 seconds) After 4700 nodes, 61 on tree, 1e+50 best solution, best possible 1.11022e-16 (2812.57 seconds) After 4800 nodes, 64 on tree, 1e+50 best solution, best possible 1.11022e-16 (2885.78 seconds) Cbc0004I Integer solution of 1 found after 3193980 iterations and 4885 nodes (2921.28 seconds) After 4900 nodes, 57 on tree, 1 best solution, best possible 1.11022e-16 (2925.37 seconds) After 5000 nodes, 47 on tree, 1 best solution, best possible 1.11022e-16 (2965.42 seconds) After 5100 nodes, 51 on tree, 1 best solution, best possible 1.11022e-16 (2998.06 seconds) After 5200 nodes, 52 on tree, 1 best solution, best possible 1.11022e-16 (3033.95 seconds) After 5300 nodes, 50 on tree, 1 best solution, best possible 1.11022e-16 (3076.36 seconds) After 5400 nodes, 54 on tree, 1 best solution, best possible 1.11022e-16 (3101.45 seconds) After 5500 nodes, 58 on tree, 1 best solution, best possible 1.11022e-16 (3138.12 seconds) After 5600 nodes, 72 on tree, 1 best solution, best possible 1.11022e-16 (3165.94 seconds) After 5700 nodes, 67 on tree, 1 best solution, best possible 1.11022e-16 (3195.01 seconds) After 5800 nodes, 68 on tree, 1 best solution, best possible 1.11022e-16 (3227.00 seconds) After 5900 nodes, 62 on tree, 1 best solution, best possible 1.11022e-16 (3260.86 seconds) After 6000 nodes, 67 on tree, 1 best solution, best possible 1.11022e-16 (3305.06 seconds) After 6100 nodes, 71 on tree, 1 best solution, best possible 1.11022e-16 (3343.17 seconds) After 6200 nodes, 64 on tree, 1 best solution, best possible 1.11022e-16 (3382.28 seconds) After 6300 nodes, 67 on tree, 1 best solution, best possible 1.11022e-16 (3414.98 seconds) After 6400 nodes, 68 on tree, 1 best solution, best possible 1.11022e-16 (3431.67 seconds) After 6500 nodes, 67 on tree, 1 best solution, best possible 1.11022e-16 (3458.38 seconds) After 6600 nodes, 75 on tree, 1 best solution, best possible 1.11022e-16 (3501.56 seconds) After 6700 nodes, 67 on tree, 1 best solution, best possible 1.11022e-16 (3545.07 seconds) After 6800 nodes, 75 on tree, 1 best solution, best possible 1.11022e-16 (3580.71 seconds) After 6900 nodes, 68 on tree, 1 best solution, best possible 1.11022e-16 (3620.43 seconds) After 7000 nodes, 77 on tree, 1 best solution, best possible 1.11022e-16 (3656.23 seconds) After 7100 nodes, 77 on tree, 1 best solution, best possible 1.11022e-16 (3686.19 seconds) After 7200 nodes, 85 on tree, 1 best solution, best possible 1.11022e-16 (3712.65 seconds) After 7300 nodes, 82 on tree, 1 best solution, best possible 1.11022e-16 (3737.60 seconds) After 7400 nodes, 84 on tree, 1 best solution, best possible 1.11022e-16 (3767.71 seconds) After 7500 nodes, 83 on tree, 1 best solution, best possible 1.11022e-16 (3795.34 seconds) After 7600 nodes, 86 on tree, 1 best solution, best possible 1.11022e-16 (3824.57 seconds) After 7700 nodes, 86 on tree, 1 best solution, best possible 1.11022e-16 (3855.34 seconds) After 7800 nodes, 85 on tree, 1 best solution, best possible 1.11022e-16 (3886.19 seconds) After 7900 nodes, 90 on tree, 1 best solution, best possible 1.11022e-16 (3923.72 seconds) After 8000 nodes, 98 on tree, 1 best solution, best possible 1.11022e-16 (3960.90 seconds) After 8100 nodes, 95 on tree, 1 best solution, best possible 1.11022e-16 (3996.85 seconds) After 8200 nodes, 92 on tree, 1 best solution, best possible 1.11022e-16 (4033.18 seconds) After 8300 nodes, 89 on tree, 1 best solution, best possible 1.11022e-16 (4070.20 seconds) After 8400 nodes, 90 on tree, 1 best solution, best possible 1.11022e-16 (4101.32 seconds) After 8500 nodes, 92 on tree, 1 best solution, best possible 1.11022e-16 (4131.96 seconds) After 8600 nodes, 94 on tree, 1 best solution, best possible 1.11022e-16 (4161.33 seconds) After 8700 nodes, 95 on tree, 1 best solution, best possible 1.11022e-16 (4186.59 seconds) After 8800 nodes, 91 on tree, 1 best solution, best possible 1.11022e-16 (4216.52 seconds) After 8900 nodes, 87 on tree, 1 best solution, best possible 1.11022e-16 (4258.84 seconds) After 9000 nodes, 89 on tree, 1 best solution, best possible 1.11022e-16 (4293.42 seconds) After 9100 nodes, 86 on tree, 1 best solution, best possible 1.11022e-16 (4325.47 seconds) After 9200 nodes, 87 on tree, 1 best solution, best possible 1.11022e-16 (4356.54 seconds) After 9300 nodes, 87 on tree, 1 best solution, best possible 1.11022e-16 (4390.19 seconds) After 9400 nodes, 90 on tree, 1 best solution, best possible 1.11022e-16 (4422.45 seconds) After 9500 nodes, 83 on tree, 1 best solution, best possible 1.11022e-16 (4450.39 seconds) After 9600 nodes, 83 on tree, 1 best solution, best possible 1.11022e-16 (4480.34 seconds) After 9700 nodes, 85 on tree, 1 best solution, best possible 1.11022e-16 (4509.53 seconds) After 9800 nodes, 89 on tree, 1 best solution, best possible 1.11022e-16 (4535.53 seconds) After 9900 nodes, 95 on tree, 1 best solution, best possible 1.11022e-16 (4563.59 seconds) After 10000 nodes, 92 on tree, 1 best solution, best possible 1.11022e-16 (4594.17 seconds) After 10100 nodes, 97 on tree, 1 best solution, best possible 1.11022e-16 (4622.71 seconds) After 10200 nodes, 92 on tree, 1 best solution, best possible 1.11022e-16 (4655.76 seconds) After 10300 nodes, 93 on tree, 1 best solution, best possible 1.11022e-16 (4689.78 seconds) After 10400 nodes, 92 on tree, 1 best solution, best possible 1.11022e-16 (4725.22 seconds) After 10500 nodes, 92 on tree, 1 best solution, best possible 1.11022e-16 (4760.64 seconds) After 10600 nodes, 84 on tree, 1 best solution, best possible 1.11022e-16 (4797.61 seconds) After 10700 nodes, 84 on tree, 1 best solution, best possible 1.11022e-16 (4830.21 seconds) After 10800 nodes, 86 on tree, 1 best solution, best possible 1.11022e-16 (4868.04 seconds) After 10900 nodes, 82 on tree, 1 best solution, best possible 1.11022e-16 (4907.68 seconds) After 11000 nodes, 78 on tree, 1 best solution, best possible 1.11022e-16 (4940.97 seconds) After 11100 nodes, 150 on tree, 1 best solution, best possible 1.11022e-16 (4989.93 seconds) After 11200 nodes, 186 on tree, 1 best solution, best possible 1.11022e-16 (5028.55 seconds) After 11300 nodes, 234 on tree, 1 best solution, best possible 1.11022e-16 (5063.16 seconds) After 11400 nodes, 273 on tree, 1 best solution, best possible 1.11022e-16 (5101.76 seconds) After 11500 nodes, 312 on tree, 1 best solution, best possible 1.11022e-16 (5141.86 seconds) After 11600 nodes, 349 on tree, 1 best solution, best possible 1.11022e-16 (5184.06 seconds) After 11700 nodes, 383 on tree, 1 best solution, best possible 1.11022e-16 (5218.55 seconds) After 11800 nodes, 432 on tree, 1 best solution, best possible 1.11022e-16 (5259.32 seconds) After 11900 nodes, 475 on tree, 1 best solution, best possible 1.11022e-16 (5310.65 seconds) After 12000 nodes, 510 on tree, 1 best solution, best possible 1.11022e-16 (5347.47 seconds) After 12100 nodes, 545 on tree, 1 best solution, best possible 1.11022e-16 (5382.19 seconds) After 12200 nodes, 588 on tree, 1 best solution, best possible 1.11022e-16 (5421.28 seconds) After 12300 nodes, 631 on tree, 1 best solution, best possible 1.11022e-16 (5475.17 seconds) After 12400 nodes, 656 on tree, 1 best solution, best possible 1.11022e-16 (5513.82 seconds) After 12500 nodes, 694 on tree, 1 best solution, best possible 1.11022e-16 (5555.64 seconds) After 12600 nodes, 728 on tree, 1 best solution, best possible 1.11022e-16 (5588.43 seconds) After 12700 nodes, 771 on tree, 1 best solution, best possible 1.11022e-16 (5627.66 seconds) After 12800 nodes, 805 on tree, 1 best solution, best possible 1.11022e-16 (5668.36 seconds) After 12900 nodes, 854 on tree, 1 best solution, best possible 1.11022e-16 (5728.89 seconds) After 13000 nodes, 882 on tree, 1 best solution, best possible 1.11022e-16 (5777.11 seconds) After 13100 nodes, 869 on tree, 1 best solution, best possible 1.11022e-16 (5810.66 seconds) After 13200 nodes, 855 on tree, 1 best solution, best possible 1.11022e-16 (5845.62 seconds) After 13300 nodes, 848 on tree, 1 best solution, best possible 1.11022e-16 (5879.23 seconds) After 13400 nodes, 844 on tree, 1 best solution, best possible 1.11022e-16 (5919.53 seconds) After 13500 nodes, 844 on tree, 1 best solution, best possible 1.11022e-16 (5945.74 seconds) After 13600 nodes, 831 on tree, 1 best solution, best possible 1.11022e-16 (5979.40 seconds) After 13700 nodes, 830 on tree, 1 best solution, best possible 1.11022e-16 (6012.55 seconds) After 13800 nodes, 829 on tree, 1 best solution, best possible 1.11022e-16 (6040.84 seconds) After 13900 nodes, 833 on tree, 1 best solution, best possible 1.11022e-16 (6069.30 seconds) After 14000 nodes, 828 on tree, 1 best solution, best possible 1.11022e-16 (6090.85 seconds) After 14100 nodes, 864 on tree, 1 best solution, best possible 1.11022e-16 (6131.35 seconds) After 14200 nodes, 910 on tree, 1 best solution, best possible 1.11022e-16 (6163.23 seconds) After 14300 nodes, 935 on tree, 1 best solution, best possible 1.11022e-16 (6198.02 seconds) After 14400 nodes, 979 on tree, 1 best solution, best possible 1.11022e-16 (6236.17 seconds) After 14500 nodes, 1011 on tree, 1 best solution, best possible 1.11022e-16 (6283.89 seconds) After 14600 nodes, 1059 on tree, 1 best solution, best possible 1.11022e-16 (6339.04 seconds) After 14700 nodes, 1104 on tree, 1 best solution, best possible 1.11022e-16 (6387.54 seconds) After 14800 nodes, 1134 on tree, 1 best solution, best possible 1.11022e-16 (6428.84 seconds) After 14900 nodes, 1172 on tree, 1 best solution, best possible 1.11022e-16 (6459.72 seconds) After 15000 nodes, 1217 on tree, 1 best solution, best possible 1.11022e-16 (6495.03 seconds) After 15100 nodes, 1258 on tree, 1 best solution, best possible 1.11022e-16 (6524.97 seconds) After 15200 nodes, 1279 on tree, 1 best solution, best possible 1.11022e-16 (6560.16 seconds) After 15300 nodes, 1326 on tree, 1 best solution, best possible 1.11022e-16 (6592.70 seconds) After 15400 nodes, 1369 on tree, 1 best solution, best possible 1.11022e-16 (6627.31 seconds) After 15500 nodes, 1408 on tree, 1 best solution, best possible 1.11022e-16 (6662.70 seconds) After 15600 nodes, 1452 on tree, 1 best solution, best possible 1.11022e-16 (6703.98 seconds) After 15700 nodes, 1496 on tree, 1 best solution, best possible 1.11022e-16 (6763.00 seconds) After 15800 nodes, 1535 on tree, 1 best solution, best possible 1.11022e-16 (6814.00 seconds) After 15900 nodes, 1569 on tree, 1 best solution, best possible 1.11022e-16 (6853.42 seconds) After 16000 nodes, 1580 on tree, 1 best solution, best possible 1.11022e-16 (6892.30 seconds) After 16100 nodes, 1608 on tree, 1 best solution, best possible 1.11022e-16 (6927.14 seconds) After 16200 nodes, 1641 on tree, 1 best solution, best possible 1.11022e-16 (6969.45 seconds) After 16300 nodes, 1680 on tree, 1 best solution, best possible 1.11022e-16 (7002.09 seconds) After 16400 nodes, 1714 on tree, 1 best solution, best possible 1.11022e-16 (7033.56 seconds) After 16500 nodes, 1733 on tree, 1 best solution, best possible 1.11022e-16 (7071.30 seconds) After 16600 nodes, 1776 on tree, 1 best solution, best possible 1.11022e-16 (7104.15 seconds) After 16700 nodes, 1817 on tree, 1 best solution, best possible 1.11022e-16 (7137.54 seconds) After 16800 nodes, 1868 on tree, 1 best solution, best possible 1.11022e-16 (7169.35 seconds) Thread 0 used 8373 times, waiting to start 1.49249, 48323 locks, 2.73349 locked, 0.0828556 waiting for locks Thread 1 used 8504 times, waiting to start 3.81157, 48986 locks, 2.46661 locked, 0.213944 waiting for locks Main thread 3592.36 waiting for threads, 33943 locks, 0.0694278 locked, 0.0561988 waiting for locks Exiting on maximum time Partial search - best objective 1 (best possible 1.11022e-16), took 7555267 iterations and 16876 nodes (7198.02 seconds) Strong branching done 5720 times (553197 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 65, 79 variables fixed on reduced cost Cuts at root node changed objective from 0 to 1.11022e-16 Probing was tried 2144 times and created 9106 cuts of which 5087 were active after adding rounds of cuts (9.261 seconds) Gomory was tried 2144 times and created 2354 cuts of which 84 were active after adding rounds of cuts (52.763 seconds) Knapsack was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) Clique was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.048 seconds) MixedIntegerRounding2 was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) FlowCover was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.684 seconds) Result - Stopped on time objective 1 after 16876 nodes and 7555267 iterations - took 7200.98 seconds (total time 7202.01) Total time 7202.09 Time limit reached. Have feasible solution. wallclocktime: 3623.29 used seconds: 7202.1 MIP solution: 1 (16876 nodes, 7202.1 seconds) Best possible: 1.110223025e-16 Absolute gap: 1 (absolute tolerance optca: 0) Relative gap: 1 (relative tolerance optcr: 0) --- Restarting execution --- acc-tight-6.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job acc-tight-6.gms Stop 07/17/08 13:01:54 elapsed 1:00:23.434