--- Job swath Start 07/18/08 18:08:32 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 --- swath.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/swath.gdx --- swath.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.062 --- swath.gms(123) 5 Mb --- Generating MIP model m --- swath.gms(124) 6 Mb --- 885 rows 6,806 columns 34,967 non-zeroes --- 6,724 discrete-columns --- swath.gms(124) 6 Mb --- Executing Cbc: elapsed 0:00:00.166 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: 6805 columns and 884 rows. 6724 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 334.497 - 0.03 seconds 401 variables fixed 0 fixed, 20 tightened bounds, 0 strengthened rows, 0 substitutions 0 fixed, 20 tightened bounds, 0 strengthened rows, 0 substitutions 0 fixed, 20 tightened bounds, 0 strengthened rows, 0 substitutions 0 fixed, 20 tightened bounds, 0 strengthened rows, 0 substitutions 0 fixed, 20 tightened bounds, 0 strengthened rows, 0 substitutions 0 fixed, 20 tightened bounds, 0 strengthened rows, 0 substitutions 0 fixed, 20 tightened bounds, 0 strengthened rows, 0 substitutions 0 fixed, 20 tightened bounds, 0 strengthened rows, 0 substitutions 0 fixed, 20 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 482 rows, 6260 columns (6240 integer) and 25480 elements Pass 1: suminf. 1.80000 obj. 346.003 iterations 59 Pass 2: suminf. 2.00000 obj. 408.893 iterations 59 Pass 3: suminf. 1.80000 obj. 411.647 iterations 22 Pass 4: suminf. 1.80000 obj. 430.348 iterations 38 Pass 5: suminf. 1.80000 obj. 430.348 iterations 2 Pass 6: suminf. 1.80000 obj. 596.6 iterations 70 Pass 7: suminf. 1.80000 obj. 596.6 iterations 7 Pass 8: suminf. 2.96667 obj. 652.253 iterations 79 Pass 9: suminf. 1.80000 obj. 653.9 iterations 56 Pass 10: suminf. 1.80000 obj. 653.9 iterations 0 Pass 11: suminf. 2.40000 obj. 620.072 iterations 77 Pass 12: suminf. 1.80000 obj. 611.669 iterations 35 Pass 13: suminf. 2.40000 obj. 751.128 iterations 72 Pass 14: suminf. 1.80000 obj. 754.008 iterations 16 Pass 15: suminf. 5.30000 obj. 1013.24 iterations 118 Pass 16: suminf. 5.15000 obj. 1023.43 iterations 11 Pass 17: suminf. 2.90000 obj. 1063.69 iterations 36 Pass 18: suminf. 1.80000 obj. 1000.95 iterations 120 Pass 19: suminf. 1.80000 obj. 1000.95 iterations 0 Pass 20: suminf. 3.00000 obj. 1044.48 iterations 95 No solution found this major pass Before mini branch and bound, 6063 integers at bound fixed and 1 continuous Full problem 482 rows 6260 columns, reduced to 213 rows 177 columns Mini branch and bound did not improve solution (1.03 seconds) Full problem 483 rows 6260 columns, reduced to 483 rows 6260 columns - too large After 1.21 seconds - Feasibility pump exiting - took 1.20 seconds 13 added rows had average density of 78.8462 At root node, 13 cuts changed objective from 334.497 to 335.225 in 3 passes Cut generator 0 (Probing) - 0 row cuts (3 active), 9 column cuts in 0.140 seconds - new frequency is 1 Cut generator 1 (Gomory) - 8 row cuts (1 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.000 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) - 39 row cuts (7 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 8 row cuts (2 active), 0 column cuts in 0.036 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 335.225 (1.54 seconds) After 100 nodes, 51 on tree, 1e+50 best solution, best possible 335.561 (11.47 seconds) After 200 nodes, 96 on tree, 605.625 best solution, best possible 335.561 (16.43 seconds) After 300 nodes, 146 on tree, 605.625 best solution, best possible 335.561 (21.10 seconds) After 400 nodes, 190 on tree, 605.625 best solution, best possible 335.561 (25.16 seconds) After 500 nodes, 234 on tree, 605.625 best solution, best possible 335.561 (28.83 seconds) After 600 nodes, 278 on tree, 605.625 best solution, best possible 335.561 (32.13 seconds) After 700 nodes, 318 on tree, 605.625 best solution, best possible 335.561 (35.58 seconds) After 800 nodes, 359 on tree, 605.625 best solution, best possible 335.561 (38.51 seconds) After 900 nodes, 406 on tree, 605.625 best solution, best possible 335.561 (41.55 seconds) After 1000 nodes, 444 on tree, 605.625 best solution, best possible 335.561 (43.97 seconds) After 1100 nodes, 487 on tree, 605.625 best solution, best possible 335.561 (46.47 seconds) After 1200 nodes, 527 on tree, 605.625 best solution, best possible 335.561 (48.54 seconds) After 1300 nodes, 573 on tree, 605.625 best solution, best possible 335.561 (50.85 seconds) After 1400 nodes, 617 on tree, 605.625 best solution, best possible 335.561 (53.25 seconds) After 1500 nodes, 652 on tree, 605.625 best solution, best possible 335.561 (55.66 seconds) After 1600 nodes, 695 on tree, 605.625 best solution, best possible 335.561 (57.92 seconds) After 1700 nodes, 731 on tree, 605.625 best solution, best possible 335.561 (60.02 seconds) After 1800 nodes, 775 on tree, 605.625 best solution, best possible 335.561 (63.53 seconds) After 1900 nodes, 815 on tree, 605.625 best solution, best possible 335.561 (65.79 seconds) After 2000 nodes, 849 on tree, 605.625 best solution, best possible 335.561 (68.16 seconds) After 2100 nodes, 894 on tree, 605.625 best solution, best possible 335.561 (70.54 seconds) After 2200 nodes, 940 on tree, 605.625 best solution, best possible 335.561 (72.48 seconds) After 2300 nodes, 982 on tree, 605.625 best solution, best possible 335.561 (74.15 seconds) After 2400 nodes, 1024 on tree, 605.625 best solution, best possible 335.561 (76.02 seconds) After 2500 nodes, 1064 on tree, 605.625 best solution, best possible 335.561 (78.16 seconds) After 2600 nodes, 1109 on tree, 605.625 best solution, best possible 335.561 (79.70 seconds) After 2700 nodes, 1144 on tree, 605.625 best solution, best possible 335.561 (81.35 seconds) After 2800 nodes, 1185 on tree, 605.625 best solution, best possible 335.561 (83.12 seconds) Cbc0038I Full problem 482 rows 6260 columns, reduced to 380 rows 20 columns Cbc0038I Full problem 482 rows 6260 columns, reduced to 380 rows 20 columns Cbc0038I Full problem 482 rows 6260 columns, reduced to 380 rows 21 columns Cbc0038I Full problem 482 rows 6260 columns, reduced to 380 rows 20 columns --- Restarting execution --- swath.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job swath.gms Stop 07/18/08 19:09:42 elapsed 1:01:10.620