--- Job fiber Start 08/21/08 07:32:01 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 --- fiber.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/fiber.gdx --- fiber.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.038 --- fiber.gms(123) 4 Mb --- Generating MIP model m --- fiber.gms(124) 4 Mb --- 364 rows 1,299 columns 4,199 non-zeroes --- 1,254 discrete-columns --- fiber.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.056 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 1298 columns and 363 rows. 1254 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 156083 - 0.01 seconds 0 fixed, 45 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 295 rows, 1206 columns (1162 integer) and 2616 elements Pass 1: obj. 3.84259 --> up = 3 , down = 0 Pass 2: obj. 0.84259 --> up = 0 , down = 0 -- rand = 7 ( 25) Pass 3: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 26) - solution found of 1.69536e+06 - cleaned solution of 1.69536e+06 Before mini branch and bound, 1112 integers at bound fixed and 6 continuous Full problem 295 rows 1206 columns, reduced to 3 rows 6 columns Mini branch and bound improved solution from 1.69536e+06 to 1.68665e+06 (0.02 seconds) Round again with cutoff of 1.53359e+06 Pass 4: obj. 3.98148 --> up = 2 , down = 1 Pass 5: obj. 0.98148 --> up = 0 , down = 0 -- rand = 7 ( 21) Pass 6: obj. 0.42207 --> up = 0 , down = 0 -- rand = 1 ( 14) Pass 7: obj. 0.12963 --> up = 0 , down = 0 -- rand = 1 ( 24) perturbation applied Pass 8: obj. 169.12152 --> up = 13 , down = 158 Pass 9: obj. 3.91188 --> up = 0 , down = 0 -- rand = 14 ( 14) Pass 10: obj. 7.99306 --> up = 1 , down = 9 Pass 11: obj. 2.73170 --> up = 0 , down = 0 -- rand = 16 ( 27) Pass 12: obj. 13.23329 --> up = 1 , down = 15 perturbation applied Pass 13: obj. 202.00280 --> up = 6 , down = 197 Pass 14: obj. 4.11526 --> up = 1 , down = 0 Pass 15: obj. 3.11526 --> up = 0 , down = 0 -- rand = 12 ( 12) Pass 16: obj. 8.44025 --> up = 1 , down = 10 Pass 17: obj. 2.89396 --> up = 0 , down = 0 -- rand = 12 ( 12) Pass 18: obj. 8.96163 --> up = 1 , down = 10 Pass 19: obj. 3.41534 --> up = 0 , down = 0 -- rand = 14 ( 14) Pass 20: obj. 10.14754 --> up = 1 , down = 12 perturbation applied Pass 21: obj. 177.45925 --> up = 6 , down = 173 Pass 22: obj. 3.28371 --> up = 0 , down = 0 -- rand = 20 ( 24) Pass 23: obj. 15.05544 --> No solution found this major pass Before mini branch and bound, 908 integers at bound fixed and 5 continuous Full problem 295 rows 1206 columns, reduced to 57 rows 186 columns Mini branch and bound improved solution from 1.68665e+06 to 551676 (0.19 seconds) After 0.20 seconds - Feasibility pump exiting - took 0.19 seconds Integer solution of 551676 found by feasibility pump after 0 iterations and 0 nodes (0.20 seconds) Full problem 295 rows 1206 columns, reduced to 0 rows 0 columns 49 added rows had average density of 78 At root node, 49 cuts changed objective from 156083 to 394590 in 14 passes Cut generator 0 (Probing) - 1 row cuts (0 active), 2 column cuts in 0.176 seconds - new frequency is 2 Cut generator 1 (Gomory) - 305 row cuts (8 active), 0 column cuts in 0.060 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 118 row cuts (9 active), 0 column cuts in 0.056 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) - 22 row cuts (6 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 77 row cuts (9 active), 0 column cuts in 0.068 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 208 row cuts (17 active), 0 column cuts in 0.052 seconds - new frequency is -100 After 0 nodes, 1 on tree, 551676 best solution, best possible 394590 (1.23 seconds) Full problem 295 rows 1206 columns, reduced to 10 rows 28 columns Integer solution of 405935 found after 888 iterations and 17 nodes (1.94 seconds) Search completed - best objective 405935.18, took 888 iterations and 18 nodes (1.94 seconds) Strong branching done 654 times (7964 iterations), fathomed 5 nodes and fixed 18 variables Maximum depth 6, 2124 variables fixed on reduced cost Cuts at root node changed objective from 156083 to 394590 Probing was tried 21 times and created 1 cuts of which 5 were active after adding rounds of cuts (0.184 seconds) Gomory was tried 28 times and created 326 cuts of which 10 were active after adding rounds of cuts (0.068 seconds) Knapsack was tried 30 times and created 211 cuts of which 29 were active after adding rounds of cuts (0.100 seconds) Clique was tried 14 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 14 times and created 22 cuts of which 6 were active after adding rounds of cuts (0.008 seconds) FlowCover was tried 30 times and created 130 cuts of which 18 were active after adding rounds of cuts (0.112 seconds) TwoMirCuts was tried 14 times and created 208 cuts of which 17 were active after adding rounds of cuts (0.052 seconds) Result - Finished objective 405935.18 after 18 nodes and 888 iterations - took 1.99 seconds (total time 2.00) Total time 2.00 Solved to optimality. Writing solution. Objective: 405935 Time: 2 s --- Restarting execution --- fiber.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job fiber.gms Stop 08/21/08 07:32:03 elapsed 0:00:02.104