--- Job bc1 Start 07/17/08 14:07:25 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 --- bc1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/bc1.gdx --- bc1.gms(148) 10 Mb --- Starting execution: elapsed 0:00:00.221 --- bc1.gms(123) 11 Mb --- Generating MIP model m --- bc1.gms(124) 22 Mb --- 1,914 rows 1,752 columns 276,844 non-zeroes --- 252 discrete-columns --- bc1.gms(124) 22 Mb --- Executing Cbc: elapsed 0:00:00.775 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" Problem statistics: 1751 columns and 1913 rows. 252 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 Continuous objective value is 0.782837 - 1.27 seconds processed model has 1876 rows, 966 columns (252 integer) and 248534 elements Pass 1: suminf. 0.46133 obj. 3.72051 iterations 225 Solution found of 4.25918 Before mini branch and bound, 248 integers at bound fixed and 658 continuous Full problem 1876 rows 966 columns, reduced to 652 rows 60 columns Mini branch and bound improved solution from 4.25918 to 3.47244 (1.07 seconds) Freeing continuous variables gives a solution of 3.44084 Round again with cutoff of 3.31475 Pass 2: suminf. 0.46133 obj. 3.31475 iterations 222 Pass 3: suminf. 0.13217 obj. 3.31475 iterations 197 Pass 4: suminf. 0.99319 obj. 3.31475 iterations 225 Pass 5: suminf. 0.13217 obj. 3.31475 iterations 247 Pass 6: suminf. 2.06423 obj. 3.31475 iterations 113 Pass 7: suminf. 1.29869 obj. 3.31475 iterations 130 Pass 8: suminf. 1.22889 obj. 3.31475 iterations 47 Pass 9: suminf. 0.76998 obj. 3.31475 iterations 157 Pass 10: suminf. 0.53201 obj. 3.31475 iterations 140 Pass 11: suminf. 0.17266 obj. 3.31475 iterations 204 Pass 12: suminf. 1.53061 obj. 3.31475 iterations 213 Pass 13: suminf. 0.99513 obj. 3.31475 iterations 113 Pass 14: suminf. 0.19460 obj. 3.31475 iterations 216 Pass 15: suminf. 0.12905 obj. 3.31475 iterations 39 Pass 16: suminf. 2.13984 obj. 3.31475 iterations 173 Pass 17: suminf. 1.22589 obj. 3.31475 iterations 138 Pass 18: suminf. 0.41664 obj. 3.31475 iterations 215 Pass 19: suminf. 1.11107 obj. 3.31475 iterations 69 Pass 20: suminf. 0.66517 obj. 3.31475 iterations 102 Pass 21: suminf. 0.52486 obj. 3.31475 iterations 182 Before mini branch and bound, 226 integers at bound fixed and 552 continuous Full problem 1876 rows 966 columns, reduced to 943 rows 188 columns Mini branch and bound did not improve solution (10.65 seconds) After 10.66 seconds - Feasibility pump exiting with objective of 1 - took 10.60 seconds Integer solution of 3.44692 found by feasibility pump after 0 iterations and 0 nodes (10.77 seconds) Full problem 1876 rows 966 columns, reduced to 1182 rows 466 columns 11 added rows had average density of 336.455 At root node, 11 cuts changed objective from 2.17994 to 2.54518 in 3 passes Cut generator 0 (Probing) - 6 row cuts (2 active), 0 column cuts in 2.048 seconds - new frequency is 2 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.060 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.032 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 123 row cuts (9 active), 0 column cuts in 0.204 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.076 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.092 seconds - new frequency is -100 After 0 nodes, 1 on tree, 3.44692 best solution, best possible 2.54518 (15.58 seconds) After 100 nodes, 16 on tree, 3.44692 best solution, best possible 2.59143 (67.68 seconds) After 200 nodes, 16 on tree, 3.44692 best solution, best possible 2.59143 (94.06 seconds) After 300 nodes, 12 on tree, 3.44692 best solution, best possible 2.59143 (120.54 seconds) Cbc0038I Full problem 1876 rows 966 columns, reduced to 1217 rows 472 columns - 1 fixed gives 1212, 471 - still too large Cbc0038I Full problem 1876 rows 966 columns, reduced to 1212 rows 471 columns - too large Cbc0038I Full problem 1876 rows 966 columns, reduced to 1217 rows 472 columns - 1 fixed gives 1212, 471 - still too large Cbc0038I Full problem 1876 rows 966 columns, reduced to 1212 rows 471 columns - too large After 400 nodes, 44 on tree, 3.41229 best solution, best possible 2.60441 (163.66 seconds) After 500 nodes, 68 on tree, 3.41229 best solution, best possible 2.61549 (187.84 seconds) After 600 nodes, 83 on tree, 3.41229 best solution, best possible 2.61806 (210.27 seconds) After 700 nodes, 88 on tree, 3.41229 best solution, best possible 2.61806 (228.90 seconds) After 800 nodes, 99 on tree, 3.41229 best solution, best possible 2.61806 (245.68 seconds) After 900 nodes, 88 on tree, 3.41229 best solution, best possible 2.61806 (260.68 seconds) After 1000 nodes, 90 on tree, 3.41229 best solution, best possible 2.61806 (280.09 seconds) After 1100 nodes, 100 on tree, 3.41229 best solution, best possible 2.61806 (297.34 seconds) After 1200 nodes, 107 on tree, 3.41229 best solution, best possible 2.61806 (318.34 seconds) After 1300 nodes, 100 on tree, 3.41229 best solution, best possible 2.61806 (339.88 seconds) Cbc0038I Full problem 1876 rows 966 columns, reduced to 1243 rows 478 columns - 1 fixed gives 1241, 477 - still too large Cbc0038I Full problem 1876 rows 966 columns, reduced to 1241 rows 477 columns - too large After 1400 nodes, 107 on tree, 3.4047 best solution, best possible 2.61806 (359.18 seconds) Cbc0038I Full problem 1876 rows 966 columns, reduced to 1217 rows 472 columns - too large After 1500 nodes, 107 on tree, 3.4047 best solution, best possible 2.61926 (386.90 seconds) After 1600 nodes, 127 on tree, 3.4047 best solution, best possible 2.63285 (423.00 seconds) After 1700 nodes, 126 on tree, 3.4047 best solution, best possible 2.63285 (438.91 seconds) After 1800 nodes, 138 on tree, 3.4047 best solution, best possible 2.63285 (451.86 seconds) After 1900 nodes, 146 on tree, 3.4047 best solution, best possible 2.63487 (470.13 seconds) After 2000 nodes, 159 on tree, 3.4047 best solution, best possible 2.64143 (493.78 seconds) After 2100 nodes, 162 on tree, 3.4047 best solution, best possible 2.64143 (509.48 seconds) After 2200 nodes, 170 on tree, 3.4047 best solution, best possible 2.64503 (529.67 seconds) After 2300 nodes, 178 on tree, 3.4047 best solution, best possible 2.64735 (546.42 seconds) After 2400 nodes, 194 on tree, 3.4047 best solution, best possible 2.64735 (558.32 seconds) Cbc0004I Integer solution of 3.40086 found after 91158 iterations and 2433 nodes (562.54 seconds) 113 Obj 3.34727 Primal inf 537.42 (162) 226 Obj 3.38541 Primal inf 4.90111 (26) 339 Obj 3.39548 Primal inf 3.1115 (12) 370 Obj 3.3963 Optimal - objective value 3.3963 Cbc0004I Integer solution of 3.3963 found after 91308 iterations and 2437 nodes (564.13 seconds) Cbc0038I Full problem 1876 rows 966 columns, reduced to 1247 rows 478 columns - 1 fixed gives 1243, 477 - still too large Cbc0038I Full problem 1876 rows 966 columns, reduced to 1243 rows 477 columns - too large Cbc0038I Full problem 1876 rows 966 columns, reduced to 1258 rows 482 columns - too large Cbc0004I Integer solution of 3.33836 found after 169539 iterations and 6990 nodes (1291.66 seconds) Cbc0038I Full problem 1876 rows 966 columns, reduced to 1251 rows 480 columns - too large Cbc0038I Full problem 1876 rows 966 columns, reduced to 1258 rows 482 columns - too large Solved to optimality. wallclocktime: 869.126 used seconds: 1481.43 MIP solution: 3.338362548 (8663 nodes, 1481.43 seconds) Best possible: 3.338362548 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- bc1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job bc1.gms Stop 07/17/08 14:21:55 elapsed 0:14:30.190