--- Job ran17x17 Start 07/18/08 16:00:23 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 --- ran17x17.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran17x17.gdx --- ran17x17.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.007 --- ran17x17.gms(123) 4 Mb --- Generating MIP model m --- ran17x17.gms(124) 4 Mb --- 324 rows 579 columns 1,735 non-zeroes --- 289 discrete-columns --- Executing Cbc: elapsed 0:00:00.017 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: 578 columns and 323 rows. 289 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 1215.25 - 0.01 seconds processed model has 323 rows, 578 columns (289 integer) and 1156 elements Pass 1: suminf. 2.14901 obj. 1265.86 iterations 165 Solution found of 1574 Before mini branch and bound, 267 integers at bound fixed and 266 continuous Full problem 323 rows 578 columns, reduced to 20 rows 24 columns Mini branch and bound improved solution from 1574 to 1464 (0.02 seconds) Round again with cutoff of 1439.12 Pass 2: suminf. 1.72044 obj. 1263.96 iterations 146 Pass 3: suminf. 0.56756 obj. 1439.12 iterations 128 Pass 4: suminf. 0.47894 obj. 1439.12 iterations 42 Pass 5: suminf. 0.42410 obj. 1439.12 iterations 81 Pass 6: suminf. 0.34243 obj. 1439.12 iterations 38 Pass 7: suminf. 0.55347 obj. 1439.12 iterations 46 Pass 8: suminf. 0.55347 obj. 1439.12 iterations 51 Pass 9: suminf. 0.51217 obj. 1439.12 iterations 42 Pass 10: suminf. 0.51217 obj. 1439.12 iterations 43 Pass 11: suminf. 0.42411 obj. 1439.12 iterations 61 Pass 12: suminf. 3.21272 obj. 1439.12 iterations 101 Pass 13: suminf. 1.60435 obj. 1439.12 iterations 59 Pass 14: suminf. 1.60435 obj. 1439.12 iterations 8 Pass 15: suminf. 3.10009 obj. 1439.12 iterations 112 Pass 16: suminf. 2.24228 obj. 1439.12 iterations 55 Pass 17: suminf. 1.74237 obj. 1439.12 iterations 64 Pass 18: suminf. 1.64853 obj. 1439.12 iterations 50 Pass 19: suminf. 2.82333 obj. 1439.12 iterations 57 Pass 20: suminf. 2.29115 obj. 1439.12 iterations 36 Pass 21: suminf. 1.72802 obj. 1439.12 iterations 17 Before mini branch and bound, 238 integers at bound fixed and 239 continuous Full problem 323 rows 578 columns, reduced to 66 rows 86 columns Mini branch and bound improved solution from 1464 to 1434 (0.18 seconds) After 0.18 seconds - Feasibility pump exiting with objective of 1434 - took 0.18 seconds Integer solution of 1434 found by feasibility pump after 0 iterations and 0 nodes (0.18 seconds) Full problem 323 rows 578 columns, reduced to 0 rows 0 columns 42 added rows had average density of 26.5714 At root node, 42 cuts changed objective from 1215.25 to 1313.91 in 8 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.036 seconds - new frequency is 10 Cut generator 1 (Gomory) - 14 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 54 row cuts (8 active), 0 column cuts in 0.012 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) - 47 row cuts (12 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 21 row cuts (12 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 58 row cuts (10 active), 0 column cuts in 0.040 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1434 best solution, best possible 1313.91 (0.62 seconds) After 1000 nodes, 59 on tree, 1434 best solution, best possible 1320.58 (8.02 seconds) After 2000 nodes, 77 on tree, 1434 best solution, best possible 1320.58 (10.58 seconds) After 3000 nodes, 64 on tree, 1434 best solution, best possible 1320.58 (12.96 seconds) Cbc0004I Integer solution of 1430 found after 43198 iterations and 3270 nodes (13.65 seconds) Cbc0038I Full problem 323 rows 578 columns, reduced to 0 rows 0 columns Cbc0038I Full problem 323 rows 578 columns, reduced to 34 rows 39 columns Cbc0004I Integer solution of 1421 found after 67984 iterations and 4769 nodes (19.73 seconds) Cbc0038I Full problem 323 rows 578 columns, reduced to 47 rows 56 columns Cbc0038I Full problem 323 rows 578 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of 1410 found by combine solutions after 67992 iterations and 4770 nodes (19.87 seconds) Cbc0038I Full problem 323 rows 578 columns, reduced to 0 rows 0 columns Cbc0004I Integer solution of 1374 found after 155743 iterations and 11595 nodes (36.96 seconds) Cbc0038I Full problem 323 rows 578 columns, reduced to 61 rows 76 columns Cbc0038I Full problem 323 rows 578 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of 1373 found by combine solutions after 155781 iterations and 11598 nodes (37.33 seconds) Cbc0038I Full problem 323 rows 578 columns, reduced to 0 rows 0 columns Solved to optimality. wallclocktime: 24.5982 used seconds: 45.88 MIP solution: 1373 (15429 nodes, 45.88 seconds) Best possible: 1373 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran17x17.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran17x17.gms Stop 07/18/08 16:00:48 elapsed 0:00:24.641