--- Job ran13x13 Start 08/24/08 05:49:55 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 --- ran13x13.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran13x13.gdx --- ran13x13.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- ran13x13.gms(123) 4 Mb --- Generating MIP model m --- ran13x13.gms(124) 4 Mb --- 196 rows 339 columns 1,015 non-zeroes --- 169 discrete-columns --- Executing Cbc: elapsed 0:00:00.013 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 338 columns and 195 rows. 169 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 2691.44 - 0.01 seconds Optimal - objective value 2691.44 processed model has 195 rows, 338 columns (169 integer) and 676 elements Pass 1: suminf. 0.95476 (6) obj. 3004.65 iterations 72 Solution found of 3811 Before mini branch and bound, 146 integers at bound fixed and 145 continuous Full problem 195 rows 338 columns, reduced to 26 rows 30 columns Mini branch and bound improved solution from 3811 to 3494 (0.02 seconds) Round again with cutoff of 3413.74 Pass 2: suminf. 0.95476 (6) obj. 2988.15 iterations 64 Pass 3: suminf. 0.43790 (2) obj. 3413.74 iterations 41 Pass 4: suminf. 0.07692 (1) obj. 3363.08 iterations 24 Pass 5: suminf. 0.30515 (1) obj. 3413.74 iterations 20 Pass 6: suminf. 3.51470 (11) obj. 3413.74 iterations 75 Pass 7: suminf. 2.20761 (8) obj. 3413.74 iterations 38 Pass 8: suminf. 1.58309 (7) obj. 3413.74 iterations 37 Pass 9: suminf. 1.51420 (8) obj. 3413.74 iterations 25 Pass 10: suminf. 2.19016 (8) obj. 3413.74 iterations 40 Pass 11: suminf. 1.91174 (8) obj. 3413.74 iterations 3 Pass 12: suminf. 1.21802 (6) obj. 3413.74 iterations 54 Pass 13: suminf. 0.88558 (4) obj. 3413.74 iterations 17 Pass 14: suminf. 1.06514 (5) obj. 3413.74 iterations 24 Pass 15: suminf. 1.04708 (6) obj. 3413.74 iterations 17 Pass 16: suminf. 1.28559 (6) obj. 3413.74 iterations 32 Pass 17: suminf. 1.19191 (5) obj. 3413.74 iterations 10 Pass 18: suminf. 1.14244 (5) obj. 3413.74 iterations 22 Pass 19: suminf. 0.58183 (5) obj. 3413.74 iterations 25 Pass 20: suminf. 1.05466 (6) obj. 3413.74 iterations 14 Pass 21: suminf. 2.42353 (10) obj. 3413.74 iterations 88 No solution found this major pass Before mini branch and bound, 118 integers at bound fixed and 119 continuous Full problem 195 rows 338 columns, reduced to 66 rows 91 columns Mini branch and bound did not improve solution (0.12 seconds) After 0.12 seconds - Feasibility pump exiting with objective of 3494 - took 0.12 seconds Integer solution of 3494 found by feasibility pump after 0 iterations and 0 nodes (0.12 seconds) Full problem 195 rows 338 columns, reduced to 0 rows 0 columns 38 added rows had average density of 60.9211 At root node, 38 cuts changed objective from 2691.44 to 3012.13 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.140 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 2905 row cuts, 0 column cuts (35 active) in 0.276 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 113 row cuts, 0 column cuts (2 active) in 0.052 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 395 row cuts, 0 column cuts (1 active) in 0.024 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 252 row cuts, 0 column cuts (0 active) in 0.316 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 306 row cuts, 0 column cuts (0 active) in 0.072 seconds - new frequency is -100 Optimal - objective value 3012.13 Optimal - objective value 3012.13 After 0 nodes, 1 on tree, 3494 best solution, best possible 3012.13 (1.88 seconds) Full problem 195 rows 338 columns, reduced to 28 rows 32 columns Integer solution of 3369 found by combine solutions after 18901 iterations and 616 nodes (6.60 seconds) After 1000 nodes, 242 on tree, 3369 best solution, best possible 3043.28 (9.07 seconds) Full problem 195 rows 338 columns, reduced to 35 rows 42 columns After 2000 nodes, 507 on tree, 3333 best solution, best possible 3043.28 (14.94 seconds) After 3000 nodes, 828 on tree, 3333 best solution, best possible 3060.54 (20.10 seconds) Integer solution of 3302 found after 113255 iterations and 3631 nodes (22.99 seconds) Full problem 195 rows 338 columns, reduced to 37 rows 45 columns After 4000 nodes, 921 on tree, 3302 best solution, best possible 3060.68 (25.02 seconds) After 5000 nodes, 1175 on tree, 3302 best solution, best possible 3099.47 (29.66 seconds) After 6000 nodes, 1401 on tree, 3302 best solution, best possible 3103.74 (34.24 seconds) Integer solution of 3252 found after 183290 iterations and 6293 nodes (35.51 seconds) Full problem 195 rows 338 columns, reduced to 49 rows 63 columns After 7000 nodes, 822 on tree, 3252 best solution, best possible 3126.8 (39.67 seconds) After 8000 nodes, 859 on tree, 3252 best solution, best possible 3126.8 (43.38 seconds) After 9000 nodes, 872 on tree, 3252 best solution, best possible 3126.8 (47.25 seconds) After 10000 nodes, 849 on tree, 3252 best solution, best possible 3126.94 (51.02 seconds) After 11000 nodes, 838 on tree, 3252 best solution, best possible 3141.99 (54.75 seconds) After 12000 nodes, 955 on tree, 3252 best solution, best possible 3199.5 (59.66 seconds) After 13000 nodes, 995 on tree, 3252 best solution, best possible 3212.1 (63.98 seconds) After 14000 nodes, 906 on tree, 3252 best solution, best possible 3212.14 (67.21 seconds) After 15000 nodes, 912 on tree, 3252 best solution, best possible 3224.03 (71.18 seconds) After 16000 nodes, 893 on tree, 3252 best solution, best possible 3230.67 (74.90 seconds) After 17000 nodes, 821 on tree, 3252 best solution, best possible 3236.25 (78.32 seconds) After 18000 nodes, 566 on tree, 3252 best solution, best possible 3236.3 (81.00 seconds) After 19000 nodes, 425 on tree, 3252 best solution, best possible 3243.76 (84.39 seconds) After 20000 nodes, 100 on tree, 3252 best solution, best possible 3250.37 (87.11 seconds) Search completed - best objective 3252, took 405604 iterations and 20221 nodes (87.49 seconds) Strong branching done 3760 times (60261 iterations), fathomed 22 nodes and fixed 656 variables Maximum depth 79, 169526 variables fixed on reduced cost Cuts at root node changed objective from 2691.44 to 3012.13 Probing was tried 11363 times and created 13081 cuts of which 4862 were active after adding rounds of cuts (3.808 seconds) Gomory was tried 18269 times and created 36810 cuts of which 9725 were active after adding rounds of cuts (9.509 seconds) Knapsack was tried 23269 times and created 25500 cuts of which 5801 were active after adding rounds of cuts (9.909 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) MixedIntegerRounding2 was tried 23269 times and created 29474 cuts of which 9822 were active after adding rounds of cuts (3.572 seconds) FlowCover was tried 23269 times and created 1930 cuts of which 344 were active after adding rounds of cuts (0.708 seconds) TwoMirCuts was tried 100 times and created 306 cuts of which 0 were active after adding rounds of cuts (0.072 seconds) Result - Finished objective 3252 after 20221 nodes and 405604 iterations - took 87.50 seconds (total time 87.51) Total time 87.51 Solved to optimality. MIP solution: 3252 (20221 nodes, 87.51 seconds) Best possible: 3252 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran13x13.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran13x13.gms Stop 08/24/08 05:51:24 elapsed 0:01:28.927