--- Job danoint Start 08/21/08 20:57:26 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 --- danoint.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/danoint.gdx --- danoint.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.007 --- danoint.gms(123) 4 Mb --- Generating MIP model m --- danoint.gms(124) 4 Mb --- 665 rows 522 columns 3,234 non-zeroes --- 56 discrete-columns --- danoint.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.021 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 521 columns and 664 rows. 56 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 62.6373 - 0.07 seconds processed model has 600 rows, 457 columns (56 integer) and 3440 elements Pass 1: suminf. 2.71979 obj. 72 iterations 285 Pass 2: suminf. 1.29784 obj. 73.0674 iterations 43 Pass 3: suminf. 0.03501 obj. 76.5 iterations 175 Pass 4: suminf. 1.05426 obj. 83.8943 iterations 188 Pass 5: suminf. 2.39011 obj. 85 iterations 48 Pass 6: suminf. 1.81406 obj. 93.4898 iterations 86 Pass 7: suminf. 0.16094 obj. 102.126 iterations 177 Pass 8: suminf. 1.72800 obj. 86.4024 iterations 180 Pass 9: suminf. 0.49334 obj. 87.5316 iterations 210 Pass 10: suminf. 1.06667 obj. 82.2507 iterations 136 Pass 11: suminf. 0.00000 obj. 85 iterations 244 Solution found of 85 Before mini branch and bound, 1 integers at bound fixed and 198 continuous Full problem 600 rows 457 columns, reduced to 380 rows 256 columns - too large Mini branch and bound did not improve solution (0.20 seconds) After 0.20 seconds - Feasibility pump exiting with objective of 0 - took 0.20 seconds Integer solution of 85 found by feasibility pump after 0 iterations and 0 nodes (0.29 seconds) Full problem 600 rows 457 columns, reduced to 112 rows 121 columns 49 added rows had average density of 117.714 At root node, 49 cuts changed objective from 62.6373 to 62.6693 in 100 passes Cut generator 0 (Probing) - 32 row cuts (14 active), 0 column cuts in 0.452 seconds - new frequency is 1 Cut generator 1 (Gomory) - 163 row cuts (12 active), 0 column cuts in 0.468 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.088 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 254 row cuts (12 active), 0 column cuts in 0.096 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 201 row cuts (10 active), 0 column cuts in 1.372 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 1 row cuts (1 active), 0 column cuts in 0.124 seconds - new frequency is -100 After 0 nodes, 1 on tree, 85 best solution, best possible 62.6693 (6.32 seconds) Integer solution of 75 found after 37642 iterations and 205 nodes (21.91 seconds) Full problem 600 rows 457 columns, reduced to 261 rows 189 columns Integer solution of 70.5 found by combine solutions after 37697 iterations and 206 nodes (24.51 seconds) Integer solution of 69.5 found after 71515 iterations and 529 nodes (28.81 seconds) Full problem 600 rows 457 columns, reduced to 339 rows 225 columns Integer solution of 68.2 found after 98025 iterations and 783 nodes (36.93 seconds) Full problem 600 rows 457 columns, reduced to 352 rows 252 columns Integer solution of 68 found by combine solutions after 98097 iterations and 784 nodes (46.46 seconds) After 1000 nodes, 398 on tree, 68 best solution, best possible 62.6959 (49.62 seconds) After 2000 nodes, 766 on tree, 68 best solution, best possible 62.6959 (61.04 seconds) After 3000 nodes, 1097 on tree, 68 best solution, best possible 62.6959 (72.44 seconds) After 4000 nodes, 1466 on tree, 68 best solution, best possible 62.6959 (84.29 seconds) After 5000 nodes, 1885 on tree, 68 best solution, best possible 62.6959 (96.07 seconds) After 6000 nodes, 2273 on tree, 68 best solution, best possible 62.6959 (107.08 seconds) After 7000 nodes, 2645 on tree, 68 best solution, best possible 62.6959 (119.02 seconds) After 8000 nodes, 3015 on tree, 68 best solution, best possible 62.7101 (131.39 seconds) After 9000 nodes, 3383 on tree, 68 best solution, best possible 62.7101 (143.24 seconds) After 10000 nodes, 3761 on tree, 68 best solution, best possible 62.7101 (155.82 seconds) After 11000 nodes, 4106 on tree, 68 best solution, best possible 62.7101 (167.26 seconds) After 12000 nodes, 4606 on tree, 68 best solution, best possible 62.9503 (187.11 seconds) After 13000 nodes, 5103 on tree, 68 best solution, best possible 63.0186 (206.19 seconds) Integer solution of 66.8 found after 1403520 iterations and 13842 nodes (218.66 seconds) Full problem 600 rows 457 columns, reduced to 386 rows 277 columns - too large After 14000 nodes, 5148 on tree, 66.8 best solution, best possible 63.0252 (221.80 seconds) After 15000 nodes, 5646 on tree, 66.8 best solution, best possible 63.0778 (240.40 seconds) After 16000 nodes, 6138 on tree, 66.8 best solution, best possible 63.1183 (258.58 seconds) After 17000 nodes, 6627 on tree, 66.8 best solution, best possible 63.1525 (276.74 seconds) After 18000 nodes, 7059 on tree, 66.8 best solution, best possible 63.1526 (292.13 seconds) After 19000 nodes, 7553 on tree, 66.8 best solution, best possible 63.183 (310.48 seconds) After 20000 nodes, 8042 on tree, 66.8 best solution, best possible 63.2084 (328.53 seconds) After 21000 nodes, 8534 on tree, 66.8 best solution, best possible 63.2305 (346.53 seconds) After 22000 nodes, 8950 on tree, 66.8 best solution, best possible 63.2305 (361.97 seconds) After 23000 nodes, 9441 on tree, 66.8 best solution, best possible 63.2504 (379.77 seconds) After 24000 nodes, 9928 on tree, 66.8 best solution, best possible 63.2692 (397.33 seconds) After 25000 nodes, 10415 on tree, 66.8 best solution, best possible 63.2861 (415.05 seconds) After 26000 nodes, 10900 on tree, 66.8 best solution, best possible 63.3019 (432.77 seconds) After 27000 nodes, 11335 on tree, 66.8 best solution, best possible 63.3019 (448.07 seconds) After 28000 nodes, 11780 on tree, 66.8 best solution, best possible 63.3019 (463.22 seconds) Integer solution of 66.5 found after 3163371 iterations and 28095 nodes (463.74 seconds) Full problem 600 rows 457 columns, reduced to 386 rows 277 columns - too large After 29000 nodes, 12018 on tree, 66.5 best solution, best possible 63.3181 (480.58 seconds) After 30000 nodes, 12498 on tree, 66.5 best solution, best possible 63.3338 (499.58 seconds) After 31000 nodes, 12930 on tree, 66.5 best solution, best possible 63.3338 (515.96 seconds) After 32000 nodes, 13340 on tree, 66.5 best solution, best possible 63.3338 (531.33 seconds) Integer solution of 65.6667 found after 3631264 iterations and 32017 nodes (531.45 seconds) Full problem 600 rows 457 columns, reduced to 386 rows 277 columns - too large After 33000 nodes, 12557 on tree, 65.6667 best solution, best possible 63.3495 (550.70 seconds) After 34000 nodes, 13041 on tree, 65.6667 best solution, best possible 63.3642 (569.72 seconds) After 35000 nodes, 13470 on tree, 65.6667 best solution, best possible 63.3642 (586.54 seconds) After 36000 nodes, 13899 on tree, 65.6667 best solution, best possible 63.3642 (603.29 seconds) After 37000 nodes, 13544 on tree, 65.6667 best solution, best possible 63.3642 (610.07 seconds) After 38000 nodes, 14014 on tree, 65.6667 best solution, best possible 63.3809 (629.52 seconds) After 39000 nodes, 14442 on tree, 65.6667 best solution, best possible 63.3809 (645.56 seconds) After 40000 nodes, 14858 on tree, 65.6667 best solution, best possible 63.3809 (661.47 seconds) After 41000 nodes, 14582 on tree, 65.6667 best solution, best possible 63.3809 (668.67 seconds) After 42000 nodes, 15053 on tree, 65.6667 best solution, best possible 63.3968 (688.01 seconds) After 43000 nodes, 15477 on tree, 65.6667 best solution, best possible 63.3968 (704.33 seconds) After 44000 nodes, 15899 on tree, 65.6667 best solution, best possible 63.3968 (720.22 seconds) After 45000 nodes, 15632 on tree, 65.6667 best solution, best possible 63.3968 (727.84 seconds) After 46000 nodes, 16116 on tree, 65.6667 best solution, best possible 63.4146 (746.73 seconds) After 47000 nodes, 16528 on tree, 65.6667 best solution, best possible 63.4146 (762.80 seconds) After 48000 nodes, 16948 on tree, 65.6667 best solution, best possible 63.4146 (779.14 seconds) After 49000 nodes, 16694 on tree, 65.6667 best solution, best possible 63.4146 (787.09 seconds) After 50000 nodes, 17182 on tree, 65.6667 best solution, best possible 63.4314 (806.32 seconds) After 51000 nodes, 17609 on tree, 65.6667 best solution, best possible 63.4314 (822.56 seconds) After 52000 nodes, 18010 on tree, 65.6667 best solution, best possible 63.4314 (838.72 seconds) After 53000 nodes, 17794 on tree, 65.6667 best solution, best possible 63.4314 (846.72 seconds) After 54000 nodes, 18273 on tree, 65.6667 best solution, best possible 63.4477 (866.61 seconds) After 55000 nodes, 18687 on tree, 65.6667 best solution, best possible 63.4477 (883.34 seconds) After 56000 nodes, 19107 on tree, 65.6667 best solution, best possible 63.4477 (900.20 seconds) After 57000 nodes, 18864 on tree, 65.6667 best solution, best possible 63.4477 (908.72 seconds) After 58000 nodes, 19345 on tree, 65.6667 best solution, best possible 63.4647 (928.69 seconds) After 59000 nodes, 19763 on tree, 65.6667 best solution, best possible 63.4647 (945.24 seconds) After 60000 nodes, 20163 on tree, 65.6667 best solution, best possible 63.4647 (961.72 seconds) After 61000 nodes, 19905 on tree, 65.6667 best solution, best possible 63.4647 (970.17 seconds) After 62000 nodes, 20384 on tree, 65.6667 best solution, best possible 63.4802 (990.18 seconds) After 63000 nodes, 20789 on tree, 65.6667 best solution, best possible 63.4802 (1006.94 seconds) After 64000 nodes, 21199 on tree, 65.6667 best solution, best possible 63.4802 (1023.84 seconds) After 65000 nodes, 20987 on tree, 65.6667 best solution, best possible 63.4802 (1032.58 seconds) After 66000 nodes, 21469 on tree, 65.6667 best solution, best possible 63.496 (1052.53 seconds) After 67000 nodes, 21876 on tree, 65.6667 best solution, best possible 63.496 (1069.67 seconds) After 68000 nodes, 22284 on tree, 65.6667 best solution, best possible 63.496 (1086.44 seconds) After 69000 nodes, 22029 on tree, 65.6667 best solution, best possible 63.496 (1095.32 seconds) After 70000 nodes, 22501 on tree, 65.6667 best solution, best possible 63.5118 (1115.96 seconds) After 71000 nodes, 22919 on tree, 65.6667 best solution, best possible 63.5118 (1132.68 seconds) After 72000 nodes, 23327 on tree, 65.6667 best solution, best possible 63.5118 (1149.06 seconds) After 73000 nodes, 23096 on tree, 65.6667 best solution, best possible 63.5118 (1157.81 seconds) After 74000 nodes, 23575 on tree, 65.6667 best solution, best possible 63.5257 (1177.67 seconds) After 75000 nodes, 23972 on tree, 65.6667 best solution, best possible 63.5257 (1194.35 seconds) After 76000 nodes, 24357 on tree, 65.6667 best solution, best possible 63.5257 (1211.23 seconds) After 77000 nodes, 24136 on tree, 65.6667 best solution, best possible 63.5257 (1220.22 seconds) After 78000 nodes, 24616 on tree, 65.6667 best solution, best possible 63.5394 (1239.89 seconds) After 79000 nodes, 25029 on tree, 65.6667 best solution, best possible 63.5394 (1256.46 seconds) After 80000 nodes, 25420 on tree, 65.6667 best solution, best possible 63.5394 (1272.58 seconds) After 81000 nodes, 25226 on tree, 65.6667 best solution, best possible 63.5394 (1281.32 seconds) After 82000 nodes, 25705 on tree, 65.6667 best solution, best possible 63.5534 (1300.54 seconds) After 83000 nodes, 26087 on tree, 65.6667 best solution, best possible 63.5534 (1317.06 seconds) After 84000 nodes, 26492 on tree, 65.6667 best solution, best possible 63.5534 (1333.54 seconds) After 85000 nodes, 26250 on tree, 65.6667 best solution, best possible 63.5534 (1342.62 seconds) After 86000 nodes, 26734 on tree, 65.6667 best solution, best possible 63.5654 (1362.35 seconds) After 87000 nodes, 27147 on tree, 65.6667 best solution, best possible 63.5654 (1378.64 seconds) After 88000 nodes, 27538 on tree, 65.6667 best solution, best possible 63.5654 (1394.55 seconds) After 89000 nodes, 27325 on tree, 65.6667 best solution, best possible 63.5654 (1403.33 seconds) After 90000 nodes, 27805 on tree, 65.6667 best solution, best possible 63.5769 (1422.29 seconds) After 91000 nodes, 28201 on tree, 65.6667 best solution, best possible 63.5769 (1439.10 seconds) After 92000 nodes, 28585 on tree, 65.6667 best solution, best possible 63.5769 (1455.49 seconds) After 93000 nodes, 28358 on tree, 65.6667 best solution, best possible 63.5769 (1464.25 seconds) After 94000 nodes, 28844 on tree, 65.6667 best solution, best possible 63.5895 (1483.38 seconds) After 95000 nodes, 29227 on tree, 65.6667 best solution, best possible 63.5895 (1499.30 seconds) After 96000 nodes, 29621 on tree, 65.6667 best solution, best possible 63.5895 (1515.12 seconds) After 97000 nodes, 29405 on tree, 65.6667 best solution, best possible 63.5895 (1523.74 seconds) After 98000 nodes, 29878 on tree, 65.6667 best solution, best possible 63.6016 (1542.97 seconds) After 99000 nodes, 30270 on tree, 65.6667 best solution, best possible 63.6016 (1559.53 seconds) After 100000 nodes, 30661 on tree, 65.6667 best solution, best possible 63.6016 (1574.90 seconds) After 101000 nodes, 30408 on tree, 65.6667 best solution, best possible 63.6016 (1583.73 seconds) After 102000 nodes, 30878 on tree, 65.6667 best solution, best possible 63.6139 (1603.34 seconds) After 103000 nodes, 31276 on tree, 65.6667 best solution, best possible 63.6139 (1619.44 seconds) After 104000 nodes, 31656 on tree, 65.6667 best solution, best possible 63.6139 (1635.51 seconds) After 105000 nodes, 31460 on tree, 65.6667 best solution, best possible 63.6139 (1644.01 seconds) After 106000 nodes, 31936 on tree, 65.6667 best solution, best possible 63.6265 (1663.12 seconds) After 107000 nodes, 32323 on tree, 65.6667 best solution, best possible 63.6265 (1678.93 seconds) After 108000 nodes, 32697 on tree, 65.6667 best solution, best possible 63.6265 (1694.73 seconds) After 109000 nodes, 32479 on tree, 65.6667 best solution, best possible 63.6265 (1703.49 seconds) After 110000 nodes, 32949 on tree, 65.6667 best solution, best possible 63.6378 (1722.55 seconds) After 111000 nodes, 33328 on tree, 65.6667 best solution, best possible 63.6378 (1738.46 seconds) After 112000 nodes, 33694 on tree, 65.6667 best solution, best possible 63.6378 (1754.24 seconds) After 113000 nodes, 33444 on tree, 65.6667 best solution, best possible 63.6378 (1762.88 seconds) After 114000 nodes, 33907 on tree, 65.6667 best solution, best possible 63.6491 (1781.95 seconds) After 115000 nodes, 34287 on tree, 65.6667 best solution, best possible 63.6491 (1797.61 seconds) Exiting on maximum time Partial search - best objective 65.6667 (best possible 63.6491), took 11323302 iterations and 115143 nodes (1801.23 seconds) Strong branching done 1072 times (80995 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 35, 20967 variables fixed on reduced cost Cuts at root node changed objective from 62.6373 to 62.6693 Probing was tried 93837 times and created 120299 cuts of which 107497 were active after adding rounds of cuts (64.056 seconds) Gomory was tried 9183 times and created 1847 cuts of which 931 were active after adding rounds of cuts (8.609 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.088 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) MixedIntegerRounding2 was tried 100 times and created 254 cuts of which 12 were active after adding rounds of cuts (0.096 seconds) FlowCover was tried 19737 times and created 1882 cuts of which 1274 were active after adding rounds of cuts (2.828 seconds) TwoMirCuts was tried 100 times and created 1 cuts of which 1 were active after adding rounds of cuts (0.124 seconds) Result - Stopped on time objective 65.66666666666666 after 115143 nodes and 11323302 iterations - took 1801.25 seconds (total time 1801.32) Total time 1801.47 Time limit reached. Have feasible solution. MIP solution: 65.66666667 (115143 nodes, 1801.47 seconds) Best possible: 63.64905485 Absolute gap: 2.0176 (absolute tolerance optca: 0) Relative gap: 0.031699 (relative tolerance optcr: 0) --- Restarting execution --- danoint.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job danoint.gms Stop 08/21/08 21:27:58 elapsed 0:30:32.202