--- Job ran12x12 Start 08/22/08 01:47:54 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 --- ran12x12.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran12x12.gdx --- ran12x12.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- ran12x12.gms(123) 4 Mb --- Generating MIP model m --- ran12x12.gms(124) 4 Mb --- 169 rows 289 columns 865 non-zeroes --- 144 discrete-columns --- Executing COINCBC: elapsed 0:00:00.011 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 288 columns and 168 rows. 144 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 1826.55 - 0.00 seconds processed model has 168 rows, 288 columns (144 integer) and 576 elements Pass 1: suminf. 1.65515 obj. 1931.29 iterations 51 Solution found of 2655 Before mini branch and bound, 129 integers at bound fixed and 129 continuous Full problem 168 rows 288 columns, reduced to 14 rows 16 columns Mini branch and bound improved solution from 2655 to 2579 (0.02 seconds) Round again with cutoff of 2503.75 Pass 2: suminf. 1.65515 obj. 1931.29 iterations 49 Pass 3: suminf. 0.16898 obj. 2503.75 iterations 60 Pass 4: suminf. 0.10526 obj. 2492.16 iterations 3 Pass 5: suminf. 2.37313 obj. 2503.75 iterations 65 Pass 6: suminf. 2.07537 obj. 2503.75 iterations 31 Pass 7: suminf. 2.20643 obj. 2503.75 iterations 47 Pass 8: suminf. 1.19552 obj. 2503.75 iterations 62 Pass 9: suminf. 1.54449 obj. 2503.75 iterations 57 Pass 10: suminf. 0.86206 obj. 2503.75 iterations 58 Pass 11: suminf. 1.54449 obj. 2503.75 iterations 60 Pass 12: suminf. 0.75753 obj. 2503.75 iterations 89 Pass 13: suminf. 0.51287 obj. 2503.75 iterations 27 Pass 14: suminf. 0.75596 obj. 2503.75 iterations 31 Pass 15: suminf. 2.92944 obj. 2503.75 iterations 84 Pass 16: suminf. 1.83908 obj. 2503.75 iterations 53 Pass 17: suminf. 2.33363 obj. 2503.75 iterations 61 Pass 18: suminf. 1.65063 obj. 2503.75 iterations 52 Pass 19: suminf. 1.83435 obj. 2503.75 iterations 47 Pass 20: suminf. 1.16447 obj. 2503.75 iterations 49 Pass 21: suminf. 0.87122 obj. 2503.75 iterations 28 Before mini branch and bound, 86 integers at bound fixed and 91 continuous Full problem 168 rows 288 columns, reduced to 70 rows 101 columns Mini branch and bound did not improve solution (0.13 seconds) After 0.13 seconds - Feasibility pump exiting with objective of 8 - took 0.13 seconds Integer solution of 2655 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) Full problem 168 rows 288 columns, reduced to 0 rows 0 columns 51 added rows had average density of 16.2549 At root node, 51 cuts changed objective from 1826.55 to 2126.65 in 26 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.176 seconds - new frequency is 10 Cut generator 1 (Gomory) - 17 row cuts (0 active), 0 column cuts in 0.040 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 72 row cuts (11 active), 0 column cuts in 0.044 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 122 row cuts (28 active), 0 column cuts in 0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 68 row cuts (10 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 121 row cuts (2 active), 0 column cuts in 0.040 seconds - new frequency is -100 After 0 nodes, 1 on tree, 2655 best solution, best possible 2126.65 (0.79 seconds) Strong branching is fixing too many variables, too expensively! Integer solution of 2638 found after 9891 iterations and 369 nodes (7.78 seconds) Full problem 168 rows 288 columns, reduced to 34 rows 43 columns Integer solution of 2463 found by combine solutions after 9896 iterations and 370 nodes (7.82 seconds) After 1000 nodes, 344 on tree, 2463 best solution, best possible 2140.26 (10.99 seconds) After 2000 nodes, 800 on tree, 2463 best solution, best possible 2140.26 (14.25 seconds) Integer solution of 2445 found after 42287 iterations and 2149 nodes (14.67 seconds) Full problem 168 rows 288 columns, reduced to 46 rows 59 columns Integer solution of 2443 found by combine solutions after 42300 iterations and 2150 nodes (14.77 seconds) Integer solution of 2384 found after 43760 iterations and 2229 nodes (15.02 seconds) Full problem 168 rows 288 columns, reduced to 50 rows 66 columns Integer solution of 2378 found by combine solutions after 43768 iterations and 2230 nodes (15.14 seconds) After 3000 nodes, 717 on tree, 2378 best solution, best possible 2216.34 (19.33 seconds) After 4000 nodes, 1202 on tree, 2378 best solution, best possible 2234.28 (23.40 seconds) After 5000 nodes, 1687 on tree, 2378 best solution, best possible 2244.09 (26.91 seconds) After 6000 nodes, 2156 on tree, 2378 best solution, best possible 2250.63 (30.14 seconds) Integer solution of 2308 found after 172688 iterations and 6707 nodes (32.38 seconds) Full problem 168 rows 288 columns, reduced to 56 rows 76 columns After 7000 nodes, 1564 on tree, 2308 best solution, best possible 2256.18 (33.30 seconds) After 8000 nodes, 1771 on tree, 2308 best solution, best possible 2260.77 (35.83 seconds) After 9000 nodes, 1965 on tree, 2308 best solution, best possible 2265.17 (38.17 seconds) After 10000 nodes, 2122 on tree, 2308 best solution, best possible 2268.93 (40.28 seconds) Integer solution of 2306 found after 224220 iterations and 10141 nodes (40.57 seconds) Full problem 168 rows 288 columns, reduced to 58 rows 79 columns After 11000 nodes, 2155 on tree, 2306 best solution, best possible 2272.03 (42.49 seconds) After 12000 nodes, 2282 on tree, 2306 best solution, best possible 2274.71 (44.47 seconds) After 13000 nodes, 2378 on tree, 2306 best solution, best possible 2277.21 (46.33 seconds) Integer solution of 2291 found after 258826 iterations and 13046 nodes (46.38 seconds) Full problem 168 rows 288 columns, reduced to 62 rows 85 columns After 14000 nodes, 1328 on tree, 2291 best solution, best possible 2279.47 (48.06 seconds) After 15000 nodes, 1236 on tree, 2291 best solution, best possible 2281.7 (49.56 seconds) After 16000 nodes, 1141 on tree, 2291 best solution, best possible 2283.74 (51.05 seconds) After 17000 nodes, 962 on tree, 2291 best solution, best possible 2285.65 (52.38 seconds) After 18000 nodes, 645 on tree, 2291 best solution, best possible 2285.65 (53.22 seconds) After 19000 nodes, 359 on tree, 2291 best solution, best possible 2288.69 (54.62 seconds) Search completed - best objective 2291, took 318326 iterations and 19864 nodes (55.62 seconds) Strong branching done 12082 times (207331 iterations), fathomed 95 nodes and fixed 931 variables Maximum depth 62, 152269 variables fixed on reduced cost Cuts at root node changed objective from 1826.55 to 2126.65 Probing was tried 1245 times and created 485 cuts of which 240 were active after adding rounds of cuts (0.472 seconds) Gomory was tried 26 times and created 17 cuts of which 0 were active after adding rounds of cuts (0.040 seconds) Knapsack was tried 13419 times and created 8364 cuts of which 1304 were active after adding rounds of cuts (9.597 seconds) Clique was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 13419 times and created 20144 cuts of which 14136 were active after adding rounds of cuts (2.052 seconds) FlowCover was tried 13419 times and created 1992 cuts of which 1080 were active after adding rounds of cuts (0.380 seconds) TwoMirCuts was tried 26 times and created 121 cuts of which 2 were active after adding rounds of cuts (0.040 seconds) Result - Finished objective 2291 after 19864 nodes and 318326 iterations - took 55.62 seconds (total time 55.63) Total time 55.63 Solved to optimality. MIP solution: 2291 (19864 nodes, 55.63 seconds) Best possible: 2291 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran12x12.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran12x12.gms Stop 08/22/08 01:48:50 elapsed 0:00:55.919