--- Job rout Start 08/22/08 02:55:12 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 --- rout.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/rout.gdx --- rout.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.018 --- rout.gms(123) 4 Mb --- Generating MIP model m --- rout.gms(124) 4 Mb --- 292 rows 557 columns 2,433 non-zeroes --- 315 discrete-columns --- Executing COINCBC: elapsed 0:00:00.034 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 556 columns and 291 rows. 315 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 981.864 - 0.01 seconds processed model has 290 rows, 555 columns (315 integer) and 2115 elements Objective coefficients multiple of 0.01 Cutoff increment increased from 1e-05 to 0.00999 Pass 1: suminf. 5.22301 obj. 1107.31 iterations 63 Pass 2: suminf. 4.10260 obj. 1138.01 iterations 61 Pass 3: suminf. 3.81442 obj. 1178.38 iterations 2 Pass 4: suminf. 3.21730 obj. 1110.56 iterations 30 Pass 5: suminf. 2.24209 obj. 1169.41 iterations 12 Pass 6: suminf. 3.21647 obj. 1186.51 iterations 32 Pass 7: suminf. 1.83333 obj. 1215.77 iterations 38 Pass 8: suminf. 2.32438 obj. 1177.49 iterations 23 Pass 9: suminf. 7.60834 obj. 1207.71 iterations 118 Pass 10: suminf. 2.64414 obj. 1381.29 iterations 54 Pass 11: suminf. 2.64414 obj. 1381.29 iterations 0 Pass 12: suminf. 2.60870 obj. 1451.19 iterations 16 Pass 13: suminf. 1.00000 obj. 1545.79 iterations 12 Pass 14: suminf. 0.87089 obj. 1481.62 iterations 5 Pass 15: suminf. 0.81983 obj. 1486.53 iterations 5 Pass 16: suminf. 0.95274 obj. 1490.8 iterations 7 Pass 17: suminf. 10.84713 obj. 1320.87 iterations 114 Pass 18: suminf. 3.69143 obj. 1675.53 iterations 37 Pass 19: suminf. 1.86082 obj. 1672.39 iterations 5 Pass 20: suminf. 1.66667 obj. 1665.18 iterations 4 No solution found this major pass Before mini branch and bound, 206 integers at bound fixed and 188 continuous Full problem 290 rows 555 columns, reduced to 101 rows 161 columns Mini branch and bound improved solution from 1.79769e+308 to 1612.14 (0.28 seconds) Freeing continuous variables gives a solution of 1612.14 Round again with cutoff of 1549.11 Pass 20: suminf. 5.22301 obj. 1107.31 iterations 63 Pass 21: suminf. 4.10260 obj. 1138.01 iterations 63 Pass 22: suminf. 3.81442 obj. 1178.38 iterations 2 Pass 23: suminf. 3.21730 obj. 1110.56 iterations 34 Pass 24: suminf. 2.24209 obj. 1169.41 iterations 13 Pass 25: suminf. 3.21647 obj. 1186.51 iterations 30 Pass 26: suminf. 1.33333 obj. 1278.49 iterations 39 Pass 27: suminf. 2.32438 obj. 1177.49 iterations 23 Pass 28: suminf. 6.37334 obj. 1220.4 iterations 140 Pass 29: suminf. 0.61586 obj. 1323.25 iterations 42 Pass 30: suminf. 0.62169 obj. 1462.08 iterations 17 Pass 31: suminf. 0.33333 obj. 1472.84 iterations 3 Pass 32: suminf. 0.62169 obj. 1462.08 iterations 4 Pass 33: suminf. 5.98234 obj. 1185.16 iterations 109 Pass 34: suminf. 2.57643 obj. 1258.28 iterations 78 Pass 35: suminf. 2.11949 obj. 1284.05 iterations 6 Pass 36: suminf. 1.96032 obj. 1395.52 iterations 45 Pass 37: suminf. 1.96032 obj. 1395.52 iterations 1 Pass 38: suminf. 0.79242 obj. 1456.16 iterations 22 Pass 39: suminf. 0.79242 obj. 1456.16 iterations 0 No solution found this major pass Before mini branch and bound, 206 integers at bound fixed and 191 continuous Full problem 290 rows 555 columns, reduced to 96 rows 155 columns Mini branch and bound did not improve solution (0.57 seconds) After 0.57 seconds - Feasibility pump exiting with objective of 1612.14 - took 0.57 seconds Integer solution of 1612.14 found by feasibility pump after 0 iterations and 0 nodes (0.57 seconds) Full problem 290 rows 555 columns, reduced to 2 rows 3 columns Integer solution of 1600.43 found by combine solutions after 0 iterations and 0 nodes (0.58 seconds) 24 added rows had average density of 313.542 At root node, 24 cuts changed objective from 981.864 to 986.951 in 11 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.112 seconds - new frequency is 10 Cut generator 1 (Gomory) - 207 row cuts (13 active), 0 column cuts in 0.060 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 50 row cuts (6 active), 0 column cuts in 0.036 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 97 row cuts (4 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 1 row cuts (0 active), 0 column cuts in 0.112 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 29 row cuts (1 active), 0 column cuts in 0.060 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1600.43 best solution, best possible 986.951 (1.84 seconds) Full problem 290 rows 555 columns, reduced to 46 rows 46 columns Integer solution of 1337.68 found by combine solutions after 11148 iterations and 159 nodes (7.91 seconds) Integer solution of 1332.69 found by combine solutions after 11189 iterations and 160 nodes (7.96 seconds) Full problem 290 rows 555 columns, reduced to 73 rows 79 columns Integer solution of 1079.19 found after 32588 iterations and 897 nodes (13.59 seconds) Full problem 290 rows 555 columns, reduced to 80 rows 91 columns After 1000 nodes, 241 on tree, 1079.19 best solution, best possible 989.307 (15.07 seconds) After 2000 nodes, 604 on tree, 1079.19 best solution, best possible 1002.76 (20.76 seconds) After 3000 nodes, 881 on tree, 1079.19 best solution, best possible 1007.74 (25.59 seconds) After 4000 nodes, 1125 on tree, 1079.19 best solution, best possible 1007.74 (29.74 seconds) After 5000 nodes, 1384 on tree, 1079.19 best solution, best possible 1007.74 (33.66 seconds) After 6000 nodes, 1612 on tree, 1079.19 best solution, best possible 1008.66 (37.05 seconds) After 7000 nodes, 1789 on tree, 1079.19 best solution, best possible 1008.66 (40.22 seconds) Integer solution of 1077.56 found after 249520 iterations and 7912 nodes (43.04 seconds) Full problem 290 rows 555 columns, reduced to 92 rows 113 columns After 8000 nodes, 1936 on tree, 1077.56 best solution, best possible 1008.66 (46.30 seconds) After 9000 nodes, 2100 on tree, 1077.56 best solution, best possible 1008.66 (49.20 seconds) After 10000 nodes, 2167 on tree, 1077.56 best solution, best possible 1008.66 (52.09 seconds) After 11000 nodes, 2244 on tree, 1077.56 best solution, best possible 1008.66 (55.02 seconds) After 12000 nodes, 2556 on tree, 1077.56 best solution, best possible 1034.72 (59.08 seconds) After 13000 nodes, 2807 on tree, 1077.56 best solution, best possible 1038.72 (62.87 seconds) After 14000 nodes, 2938 on tree, 1077.56 best solution, best possible 1038.73 (65.88 seconds) After 15000 nodes, 3124 on tree, 1077.56 best solution, best possible 1042.51 (69.38 seconds) After 16000 nodes, 3323 on tree, 1077.56 best solution, best possible 1045.21 (72.72 seconds) After 17000 nodes, 3485 on tree, 1077.56 best solution, best possible 1047.51 (75.94 seconds) After 18000 nodes, 3572 on tree, 1077.56 best solution, best possible 1047.51 (78.57 seconds) After 19000 nodes, 3720 on tree, 1077.56 best solution, best possible 1049.43 (81.59 seconds) After 20000 nodes, 3823 on tree, 1077.56 best solution, best possible 1051.26 (84.59 seconds) After 21000 nodes, 3946 on tree, 1077.56 best solution, best possible 1052.55 (87.56 seconds) After 22000 nodes, 3967 on tree, 1077.56 best solution, best possible 1052.55 (89.94 seconds) After 23000 nodes, 4065 on tree, 1077.56 best solution, best possible 1053.69 (92.77 seconds) After 24000 nodes, 4159 on tree, 1077.56 best solution, best possible 1054.59 (95.58 seconds) After 25000 nodes, 4197 on tree, 1077.56 best solution, best possible 1055.48 (98.35 seconds) After 26000 nodes, 4172 on tree, 1077.56 best solution, best possible 1055.48 (100.54 seconds) After 27000 nodes, 4229 on tree, 1077.56 best solution, best possible 1056.41 (103.15 seconds) After 28000 nodes, 4236 on tree, 1077.56 best solution, best possible 1057.3 (105.73 seconds) After 29000 nodes, 4215 on tree, 1077.56 best solution, best possible 1058.18 (108.31 seconds) After 30000 nodes, 4137 on tree, 1077.56 best solution, best possible 1058.18 (110.50 seconds) After 31000 nodes, 4150 on tree, 1077.56 best solution, best possible 1059.06 (113.08 seconds) After 32000 nodes, 4160 on tree, 1077.56 best solution, best possible 1059.71 (115.67 seconds) After 33000 nodes, 4147 on tree, 1077.56 best solution, best possible 1060.35 (118.20 seconds) After 34000 nodes, 4027 on tree, 1077.56 best solution, best possible 1060.35 (120.23 seconds) After 35000 nodes, 3996 on tree, 1077.56 best solution, best possible 1061.1 (122.75 seconds) After 36000 nodes, 3989 on tree, 1077.56 best solution, best possible 1061.8 (125.18 seconds) After 37000 nodes, 3992 on tree, 1077.56 best solution, best possible 1062.38 (127.62 seconds) After 38000 nodes, 3852 on tree, 1077.56 best solution, best possible 1062.38 (129.36 seconds) After 39000 nodes, 3829 on tree, 1077.56 best solution, best possible 1062.98 (131.72 seconds) After 40000 nodes, 3796 on tree, 1077.56 best solution, best possible 1063.59 (134.02 seconds) After 41000 nodes, 3749 on tree, 1077.56 best solution, best possible 1064.28 (136.34 seconds) After 42000 nodes, 3586 on tree, 1077.56 best solution, best possible 1064.28 (138.09 seconds) After 43000 nodes, 3548 on tree, 1077.56 best solution, best possible 1064.99 (140.27 seconds) After 44000 nodes, 3477 on tree, 1077.56 best solution, best possible 1065.69 (142.58 seconds) After 45000 nodes, 3407 on tree, 1077.56 best solution, best possible 1066.4 (144.77 seconds) After 46000 nodes, 3231 on tree, 1077.56 best solution, best possible 1066.4 (146.48 seconds) After 47000 nodes, 3156 on tree, 1077.56 best solution, best possible 1067.19 (148.61 seconds) After 48000 nodes, 3097 on tree, 1077.56 best solution, best possible 1067.86 (150.81 seconds) After 49000 nodes, 2981 on tree, 1077.56 best solution, best possible 1068.52 (152.84 seconds) After 50000 nodes, 2792 on tree, 1077.56 best solution, best possible 1068.52 (154.42 seconds) After 51000 nodes, 2699 on tree, 1077.56 best solution, best possible 1069.25 (156.54 seconds) After 52000 nodes, 2582 on tree, 1077.56 best solution, best possible 1069.92 (158.59 seconds) After 53000 nodes, 2451 on tree, 1077.56 best solution, best possible 1070.54 (160.58 seconds) After 54000 nodes, 2187 on tree, 1077.56 best solution, best possible 1070.54 (162.15 seconds) After 55000 nodes, 2041 on tree, 1077.56 best solution, best possible 1071.33 (164.21 seconds) After 56000 nodes, 1867 on tree, 1077.56 best solution, best possible 1072.18 (166.27 seconds) After 57000 nodes, 1690 on tree, 1077.56 best solution, best possible 1073.04 (168.27 seconds) After 58000 nodes, 1400 on tree, 1077.56 best solution, best possible 1073.04 (169.93 seconds) After 59000 nodes, 1197 on tree, 1077.56 best solution, best possible 1074.01 (171.74 seconds) After 60000 nodes, 948 on tree, 1077.56 best solution, best possible 1074.92 (173.63 seconds) After 61000 nodes, 688 on tree, 1077.56 best solution, best possible 1075.81 (175.39 seconds) After 62000 nodes, 336 on tree, 1077.56 best solution, best possible 1075.81 (176.89 seconds) Search completed - best objective 1077.56, took 1029798 iterations and 62966 nodes (178.43 seconds) Strong branching done 8604 times (217357 iterations), fathomed 137 nodes and fixed 1501 variables Maximum depth 75, 575998 variables fixed on reduced cost Cuts at root node changed objective from 981.864 to 986.951 Probing was tried 2479 times and created 2018 cuts of which 1080 were active after adding rounds of cuts (1.084 seconds) Gomory was tried 7487 times and created 17397 cuts of which 2247 were active after adding rounds of cuts (4.628 seconds) Knapsack was tried 7994 times and created 21272 cuts of which 6304 were active after adding rounds of cuts (12.761 seconds) Clique was tried 11 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 7994 times and created 33321 cuts of which 15811 were active after adding rounds of cuts (3.488 seconds) FlowCover was tried 11 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.112 seconds) TwoMirCuts was tried 11 times and created 29 cuts of which 1 were active after adding rounds of cuts (0.060 seconds) Result - Finished objective 1077.56 after 62966 nodes and 1029798 iterations - took 178.48 seconds (total time 178.50) Total time 178.51 Solved to optimality. MIP solution: 1077.56 (62966 nodes, 178.51 seconds) Best possible: 1077.56 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- rout.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job rout.gms Stop 08/22/08 02:58:11 elapsed 0:02:59.270