--- Job ran12x12 Start 07/18/08 15:10:20 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 --- ran12x12.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran12x12.gdx --- ran12x12.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- ran12x12.gms(123) 4 Mb --- Generating MIP model m --- ran12x12.gms(124) 4 Mb --- 169 rows 289 columns 865 non-zeroes --- 144 discrete-columns --- Executing Cbc: elapsed 0:00:00.012 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: 288 columns and 168 rows. 144 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 1826.55 - 0.00 seconds processed model has 168 rows, 288 columns (144 integer) and 576 elements Pass 1: suminf. 1.65515 obj. 1931.29 iterations 52 Solution found of 2655 Before mini branch and bound, 129 integers at bound fixed and 129 continuous Full problem 168 rows 288 columns, reduced to 14 rows 16 columns Mini branch and bound improved solution from 2655 to 2579 (0.02 seconds) Round again with cutoff of 2503.75 Pass 2: suminf. 1.65515 obj. 1931.29 iterations 53 Pass 3: suminf. 0.16898 obj. 2503.75 iterations 69 Pass 4: suminf. 0.10526 obj. 2492.16 iterations 6 Pass 5: suminf. 2.37313 obj. 2503.75 iterations 67 Pass 6: suminf. 2.07537 obj. 2503.75 iterations 28 Pass 7: suminf. 2.20643 obj. 2503.75 iterations 58 Pass 8: suminf. 1.19552 obj. 2503.75 iterations 55 Pass 9: suminf. 1.54449 obj. 2503.75 iterations 51 Pass 10: suminf. 0.86206 obj. 2503.75 iterations 51 Pass 11: suminf. 1.54449 obj. 2503.75 iterations 53 Pass 12: suminf. 0.75753 obj. 2503.75 iterations 87 Pass 13: suminf. 0.51287 obj. 2503.75 iterations 50 Pass 14: suminf. 0.75596 obj. 2503.75 iterations 27 Pass 15: suminf. 2.92944 obj. 2503.75 iterations 79 Pass 16: suminf. 1.83908 obj. 2503.75 iterations 48 Pass 17: suminf. 2.33363 obj. 2503.75 iterations 51 Pass 18: suminf. 1.65063 obj. 2503.75 iterations 40 Pass 19: suminf. 1.83435 obj. 2503.75 iterations 42 Pass 20: suminf. 1.16447 obj. 2503.75 iterations 44 Pass 21: suminf. 0.87122 obj. 2503.75 iterations 30 Before mini branch and bound, 86 integers at bound fixed and 91 continuous Full problem 168 rows 288 columns, reduced to 70 rows 101 columns Mini branch and bound improved solution from 2579 to 2490 (0.15 seconds) After 0.15 seconds - Feasibility pump exiting with objective of 2490 - took 0.14 seconds Integer solution of 2490 found by feasibility pump after 0 iterations and 0 nodes (0.15 seconds) Full problem 168 rows 288 columns, reduced to 0 rows 0 columns 46 added rows had average density of 62.8261 At root node, 46 cuts changed objective from 1826.55 to 2140.22 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 2.980 seconds - new frequency is 10 Cut generator 1 (Gomory) - 205 row cuts (8 active), 0 column cuts in 0.260 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 340 row cuts (10 active), 0 column cuts in 0.132 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 354 row cuts (17 active), 0 column cuts in 0.032 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 205 row cuts (8 active), 0 column cuts in 0.224 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 157 row cuts (3 active), 0 column cuts in 0.060 seconds - new frequency is -100 After 0 nodes, 1 on tree, 2490 best solution, best possible 2140.22 (4.64 seconds) After 1000 nodes, 71 on tree, 2490 best solution, best possible 2158.61 (15.10 seconds) Cbc0038I Full problem 168 rows 288 columns, reduced to 42 rows 52 columns Cbc0038I Full problem 168 rows 288 columns, reduced to 0 rows 0 columns Cbc0004I Integer solution of 2381 found after 39932 iterations and 1881 nodes (20.02 seconds) Cbc0038I Full problem 168 rows 288 columns, reduced to 30 rows 37 columns Cbc0038I Full problem 168 rows 288 columns, reduced to 54 rows 71 columns Cbc0004I Integer solution of 2371 found after 53829 iterations and 2402 nodes (24.41 seconds) Cbc0038I Full problem 168 rows 288 columns, reduced to 59 rows 80 columns Cbc0038I Full problem 168 rows 288 columns, reduced to 30 rows 37 columns Cbc0004I Integer solution of 2326 found after 54851 iterations and 2456 nodes (24.91 seconds) Cbc0038I Full problem 168 rows 288 columns, reduced to 46 rows 60 columns Cbc0004I Integer solution of 2308 found after 54890 iterations and 2461 nodes (26.09 seconds) Cbc0038I Full problem 168 rows 288 columns, reduced to 52 rows 69 columns Cbc0038I Full problem 168 rows 288 columns, reduced to 59 rows 80 columns Cbc0004I Integer solution of 2306 found after 68935 iterations and 3163 nodes (30.90 seconds) Cbc0038I Full problem 168 rows 288 columns, reduced to 62 rows 85 columns Cbc0038I Full problem 168 rows 288 columns, reduced to 52 rows 69 columns Cbc0004I Integer solution of 2291 found after 227114 iterations and 13003 nodes (65.65 seconds) Cbc0038I Full problem 168 rows 288 columns, reduced to 64 rows 88 columns Cbc0038I Full problem 168 rows 288 columns, reduced to 52 rows 69 columns Solved to optimality. wallclocktime: 37.3846 used seconds: 68.04 MIP solution: 2291 (13243 nodes, 68.04 seconds) Best possible: 2291 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran12x12.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran12x12.gms Stop 07/18/08 15:10:57 elapsed 0:00:37.420