--- Job seymour1 Start 07/18/08 16:40:15 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 --- seymour1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/seymour1.gdx --- seymour1.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.059 --- seymour1.gms(123) 5 Mb --- Generating MIP model m --- seymour1.gms(124) 7 Mb --- 4,945 rows 1,373 columns 34,922 non-zeroes --- 451 discrete-columns --- seymour1.gms(124) 7 Mb --- Executing Cbc: elapsed 0:00:00.167 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: 1372 columns and 4944 rows. 451 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 403.846 - 2.01 seconds 0 fixed, 0 tightened bounds, 115 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 115 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 115 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 115 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 115 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 115 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 115 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 115 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 115 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 115 strengthened rows, 0 substitutions processed model has 4808 rows, 1153 columns (309 integer) and 33047 elements Pass 1: (0.39 seconds) suminf. 37.71458 obj. 418.638 iterations 756 Pass 2: (0.41 seconds) suminf. 34.96458 obj. 419.638 iterations 19 Pass 3: (0.45 seconds) suminf. 2.03651 obj. 430.104 iterations 104 Solution found of 430.104 Full problem 4809 rows 1153 columns, reduced to 3275 rows 836 columns - too large Mini branch and bound could not fix general integers Before mini branch and bound, 148 integers at bound fixed and 330 continuous Full problem 4808 rows 1153 columns, reduced to 4454 rows 675 columns - too large Mini branch and bound did not improve solution (1.12 seconds) After 1.12 seconds - Feasibility pump exiting with objective of 19 - took 1.12 seconds Integer solution of 422.778 found by feasibility pump after 0 iterations and 0 nodes (2.29 seconds) Full problem 4808 rows 1153 columns, reduced to 3348 rows 834 columns - too large Integer solution of 420.778 found by combine solutions after 0 iterations and 0 nodes (3.45 seconds) Integer solution of 418.778 found by combine solutions after 1974 iterations and 0 nodes (5.18 seconds) 24 added rows had average density of 70.5 At root node, 24 cuts changed objective from 403.846 to 405.957 in 4 passes Cut generator 0 (Probing) - 22 row cuts (17 active), 0 column cuts in 0.028 seconds - new frequency is 1 Cut generator 1 (Gomory) - 182 row cuts (4 active), 0 column cuts in 0.080 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.072 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 178 row cuts (3 active), 0 column cuts in 0.200 seconds - new frequency is -100 After 0 nodes, 1 on tree, 418.778 best solution, best possible 405.957 (6.69 seconds) Cbc0038I Full problem 4808 rows 1153 columns, reduced to 3439 rows 837 columns - too large Cbc0012I Integer solution of 416.778 found by combine solutions after 2446 iterations and 1 nodes (8.61 seconds) Cbc0012I Integer solution of 411.913 found by greedy cover after 10327 iterations and 15 nodes (33.85 seconds) Cbc0038I Full problem 4808 rows 1153 columns, reduced to 3837 rows 907 columns - too large After 100 nodes, 49 on tree, 411.913 best solution, best possible 407.285 (131.01 seconds) After 200 nodes, 96 on tree, 411.913 best solution, best possible 407.692 (200.78 seconds) Cbc0004I Integer solution of 410.764 found after 104658 iterations and 230 nodes (210.95 seconds) Cbc0004I Integer solution of 410.764 found after 105011 iterations and 231 nodes (211.77 seconds) Cbc0038I Full problem 4808 rows 1153 columns, reduced to 3843 rows 912 columns - too large Cbc0038I Full problem 4808 rows 1153 columns, reduced to 3759 rows 903 columns - too large After 300 nodes, 100 on tree, 410.764 best solution, best possible 407.692 (230.57 seconds) After 400 nodes, 102 on tree, 410.764 best solution, best possible 407.703 (254.54 seconds) After 500 nodes, 124 on tree, 410.764 best solution, best possible 407.703 (285.45 seconds) After 600 nodes, 142 on tree, 410.764 best solution, best possible 407.816 (314.34 seconds) After 700 nodes, 174 on tree, 410.764 best solution, best possible 408.084 (343.00 seconds) After 800 nodes, 198 on tree, 410.764 best solution, best possible 408.084 (372.64 seconds) After 900 nodes, 210 on tree, 410.764 best solution, best possible 408.084 (394.97 seconds) After 1000 nodes, 218 on tree, 410.764 best solution, best possible 408.293 (419.93 seconds) After 1100 nodes, 235 on tree, 410.764 best solution, best possible 408.293 (449.26 seconds) After 1200 nodes, 255 on tree, 410.764 best solution, best possible 408.328 (481.92 seconds) After 1300 nodes, 274 on tree, 410.764 best solution, best possible 408.386 (511.18 seconds) After 1400 nodes, 278 on tree, 410.764 best solution, best possible 408.386 (535.14 seconds) After 1500 nodes, 300 on tree, 410.764 best solution, best possible 408.386 (567.14 seconds) After 1600 nodes, 306 on tree, 410.764 best solution, best possible 408.386 (594.37 seconds) After 1700 nodes, 324 on tree, 410.764 best solution, best possible 408.541 (623.29 seconds) After 1800 nodes, 335 on tree, 410.764 best solution, best possible 408.541 (652.81 seconds) After 1900 nodes, 341 on tree, 410.764 best solution, best possible 408.541 (678.49 seconds) After 2000 nodes, 353 on tree, 410.764 best solution, best possible 408.541 (707.40 seconds) After 2100 nodes, 376 on tree, 410.764 best solution, best possible 408.541 (739.14 seconds) After 2200 nodes, 382 on tree, 410.764 best solution, best possible 408.541 (766.99 seconds) After 2300 nodes, 389 on tree, 410.764 best solution, best possible 408.541 (796.95 seconds) After 2400 nodes, 384 on tree, 410.764 best solution, best possible 408.541 (822.42 seconds) After 2500 nodes, 390 on tree, 410.764 best solution, best possible 408.541 (848.65 seconds) After 2600 nodes, 386 on tree, 410.764 best solution, best possible 408.541 (872.85 seconds) After 2700 nodes, 392 on tree, 410.764 best solution, best possible 408.541 (900.66 seconds) After 2800 nodes, 387 on tree, 410.764 best solution, best possible 408.541 (925.39 seconds) After 2900 nodes, 381 on tree, 410.764 best solution, best possible 408.541 (948.89 seconds) After 3000 nodes, 379 on tree, 410.764 best solution, best possible 408.874 (975.35 seconds) After 3100 nodes, 362 on tree, 410.764 best solution, best possible 408.874 (996.29 seconds) After 3200 nodes, 356 on tree, 410.764 best solution, best possible 408.874 (1021.62 seconds) After 3300 nodes, 357 on tree, 410.764 best solution, best possible 408.874 (1045.55 seconds) After 3400 nodes, 344 on tree, 410.764 best solution, best possible 408.965 (1067.23 seconds) After 3500 nodes, 339 on tree, 410.764 best solution, best possible 408.965 (1089.94 seconds) After 3600 nodes, 336 on tree, 410.764 best solution, best possible 408.968 (1112.80 seconds) After 3700 nodes, 330 on tree, 410.764 best solution, best possible 409.122 (1136.29 seconds) After 3800 nodes, 319 on tree, 410.764 best solution, best possible 409.214 (1158.01 seconds) After 3900 nodes, 304 on tree, 410.764 best solution, best possible 409.214 (1179.32 seconds) After 4000 nodes, 301 on tree, 410.764 best solution, best possible 409.214 (1201.68 seconds) After 4100 nodes, 289 on tree, 410.764 best solution, best possible 409.214 (1220.48 seconds) After 4200 nodes, 281 on tree, 410.764 best solution, best possible 409.214 (1243.21 seconds) After 4300 nodes, 278 on tree, 410.764 best solution, best possible 409.214 (1266.36 seconds) After 4400 nodes, 267 on tree, 410.764 best solution, best possible 409.322 (1287.68 seconds) After 4500 nodes, 256 on tree, 410.764 best solution, best possible 409.322 (1307.19 seconds) After 4600 nodes, 243 on tree, 410.764 best solution, best possible 409.322 (1325.49 seconds) After 4700 nodes, 231 on tree, 410.764 best solution, best possible 409.322 (1348.20 seconds) After 4800 nodes, 219 on tree, 410.764 best solution, best possible 409.322 (1370.29 seconds) After 4900 nodes, 202 on tree, 410.764 best solution, best possible 409.322 (1392.25 seconds) After 5000 nodes, 183 on tree, 410.764 best solution, best possible 409.322 (1411.74 seconds) After 5100 nodes, 164 on tree, 410.764 best solution, best possible 409.322 (1432.11 seconds) After 5200 nodes, 139 on tree, 410.764 best solution, best possible 409.322 (1452.01 seconds) After 5300 nodes, 118 on tree, 410.764 best solution, best possible 409.322 (1472.71 seconds) After 5400 nodes, 89 on tree, 410.764 best solution, best possible 409.322 (1492.54 seconds) After 5500 nodes, 59 on tree, 410.764 best solution, best possible 409.322 (1510.27 seconds) After 5600 nodes, 42 on tree, 410.764 best solution, best possible 410.128 (1532.08 seconds) After 5700 nodes, 8 on tree, 410.764 best solution, best possible 410.135 (1549.85 seconds) Thread 0 used 2858 times, waiting to start 0.248526, 16081 locks, 2.57913 locked, 0.38675 waiting for locks Thread 1 used 2878 times, waiting to start 2.2049, 16197 locks, 2.23564 locked, 0.839694 waiting for locks Main thread 780.98 waiting for threads, 11543 locks, 0.025685 locked, 0.0220743 waiting for locks Search completed - best objective 410.7637013945249, took 1304494 iterations and 5736 nodes (1557.21 seconds) Strong branching done 3732 times (229270 iterations), fathomed 0 nodes and fixed 41 variables Maximum depth 30, 17757 variables fixed on reduced cost Cuts at root node changed objective from 403.846 to 405.957 Probing was tried 2962 times and created 1286 cuts of which 897 were active after adding rounds of cuts (26.290 seconds) Gomory was tried 701 times and created 2537 cuts of which 180 were active after adding rounds of cuts (11.205 seconds) Knapsack was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.048 seconds) Clique was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.060 seconds) FlowCover was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.216 seconds) TwoMirCuts was tried 12 times and created 534 cuts of which 9 were active after adding rounds of cuts (0.600 seconds) Result - Finished objective 410.7637013945249 after 5736 nodes and 1304494 iterations - took 1558.80 seconds (total time 1560.81) Total time 1595.51 Solved to optimality. wallclocktime: 827.372 used seconds: 1595.52 MIP solution: 410.7637014 (5736 nodes, 1595.52 seconds) Best possible: 410.7637014 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- seymour1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job seymour1.gms Stop 07/18/08 16:54:02 elapsed 0:13:47.594