--- Job fixnet6 Start 08/21/08 07:32:03 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 --- fixnet6.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/fixnet6.gdx --- fixnet6.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.027 --- fixnet6.gms(123) 4 Mb --- Generating MIP model m --- fixnet6.gms(124) 4 Mb --- 479 rows 879 columns 2,551 non-zeroes --- 378 discrete-columns --- fixnet6.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.041 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 878 columns and 478 rows. 378 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.00.00, build Mar 20 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 1200.88 - 0.01 seconds processed model has 477 rows, 877 columns (378 integer) and 1754 elements Pass 1: obj. 0.37800 --> up = 0 , down = 0 -- rand = 7 ( 13) - solution found of 5315 Before mini branch and bound, 362 integers at bound fixed and 460 continuous Full problem 477 rows 877 columns, reduced to 20 rows 32 columns Mini branch and bound improved solution from 5315 to 4478 (0.03 seconds) Freeing continuous variables gives a solution of 4471.99 Round again with cutoff of 4344 Pass 2: obj. 0.37800 --> up = 0 , down = 0 -- rand = 7 ( 15) Pass 3: obj. 1.74103 --> up = 0 , down = 2 Pass 4: obj. 0.18000 --> up = 0 , down = 0 -- rand = 3 ( 10) Pass 5: obj. 1.85036 --> up = 0 , down = 2 Pass 6: obj. 0.08120 --> up = 0 , down = 0 -- rand = 2 ( 20) Pass 7: obj. 1.15837 --> up = 0 , down = 1 Pass 8: obj. 0.29508 --> up = 0 , down = 0 -- rand = 3 ( 18) Pass 9: obj. 1.97515 --> up = 0 , down = 2 Pass 10: obj. 0.48286 --> up = 0 , down = 0 -- rand = 5 ( 14) Pass 11: obj. 1.22028 --> up = 0 , down = 1 Pass 12: obj. 0.73752 --> up = 0 , down = 1 Pass 13: obj. 0.12400 --> up = 0 , down = 0 -- rand = 2 ( 17) Pass 14: obj. 1.47964 --> up = 0 , down = 1 Pass 15: obj. 0.61657 --> up = 0 , down = 0 -- rand = 3 ( 10) Pass 16: obj. 1.22028 --> up = 0 , down = 1 Pass 17: obj. 0.73752 --> up = 0 , down = 1 Pass 18: obj. 0.12400 --> up = 0 , down = 0 -- rand = 2 ( 28) Pass 19: obj. 1.47964 --> up = 0 , down = 1 Pass 20: obj. 0.61657 --> up = 0 , down = 0 -- rand = 3 ( 20) Pass 21: obj. 1.22028 --> No solution found this major pass Before mini branch and bound, 361 integers at bound fixed and 432 continuous Full problem 477 rows 877 columns, reduced to 23 rows 49 columns Mini branch and bound did not improve solution (0.10 seconds) After 0.10 seconds - Feasibility pump exiting - took 0.10 seconds Integer solution of 4435 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) Full problem 477 rows 877 columns, reduced to 19 rows 62 columns 48 added rows had average density of 53.4583 At root node, 48 cuts changed objective from 3192.04 to 3651.32 in 24 passes Cut generator 0 (Probing) - 4 row cuts (0 active), 0 column cuts in 0.216 seconds - new frequency is 2 Cut generator 1 (Gomory) - 23 row cuts (3 active), 0 column cuts in 0.056 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 13 row cuts (2 active), 0 column cuts in 0.056 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 124 row cuts (29 active), 0 column cuts in 0.016 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 20 row cuts (6 active), 0 column cuts in 0.020 seconds - new frequency is -100 After 0 nodes, 1 on tree, 4435 best solution, best possible 3651.32 (0.90 seconds) Integer solution of 4420 found by rounding after 1672 iterations and 22 nodes (3.05 seconds) Full problem 477 rows 877 columns, reduced to 42 rows 99 columns Integer solution of 3985 found by combine solutions after 1869 iterations and 24 nodes (3.19 seconds) After 1000 nodes, 11 on tree, 3985 best solution, best possible 3661.48 (8.35 seconds) Integer solution of 3983 found after 14755 iterations and 1208 nodes (10.09 seconds) Full problem 477 rows 877 columns, reduced to 54 rows 116 columns Search completed - best objective 3983, took 15414 iterations and 1298 nodes (11.48 seconds) Strong branching done 2004 times (23938 iterations), fathomed 121 nodes and fixed 246 variables Maximum depth 31, 19923 variables fixed on reduced cost Cuts at root node changed objective from 3192.04 to 3651.32 Probing was tried 481 times and created 895 cuts of which 433 were active after adding rounds of cuts (0.468 seconds) Gomory was tried 538 times and created 84 cuts of which 34 were active after adding rounds of cuts (0.360 seconds) Knapsack was tried 24 times and created 13 cuts of which 2 were active after adding rounds of cuts (0.056 seconds) Clique was tried 24 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 939 times and created 1253 cuts of which 627 were active after adding rounds of cuts (0.444 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 24 times and created 20 cuts of which 6 were active after adding rounds of cuts (0.020 seconds) Result - Finished objective 3983 after 1298 nodes and 15414 iterations - took 11.50 seconds (total time 11.50) Total time 11.51 Solved to optimality. Writing solution. Objective: 3983 Time: 11.51 s --- Restarting execution --- fixnet6.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job fixnet6.gms Stop 08/21/08 07:32:15 elapsed 0:00:11.809